# 141738 (number)

141,738 (one hundred forty-one thousand seven hundred thirty-eight) is an even six-digits composite number following 141737 and preceding 141739. In scientific notation, it is written as 1.41738 × 105. The sum of its digits is 24. It has a total of 3 prime factors and 8 positive divisors. There are 47,244 positive integers (up to 141738) that are relatively prime to 141738.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 6
• Sum of Digits 24
• Digital Root 6

## Name

Short name 141 thousand 738 one hundred forty-one thousand seven hundred thirty-eight

## Notation

Scientific notation 1.41738 × 105 141.738 × 103

## Prime Factorization of 141738

Prime Factorization 2 × 3 × 23623

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 141738 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) -1 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 141,738 is 2 × 3 × 23623. Since it has a total of 3 prime factors, 141,738 is a composite number.

## Divisors of 141738

8 divisors

 Even divisors 4 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 283488 Sum of all the positive divisors of n s(n) 141750 Sum of the proper positive divisors of n A(n) 35436 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 376.481 Returns the nth root of the product of n divisors H(n) 3.99983 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 141,738 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 141,738) is 283,488, the average is 35,436.

## Other Arithmetic Functions (n = 141738)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 47244 Total number of positive integers not greater than n that are coprime to n λ(n) 23622 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 13117 Total number of primes less than or equal to n r2(n) 0 The number of ways n can be represented as the sum of 2 squares

There are 47,244 positive integers (less than 141,738) that are coprime with 141,738. And there are approximately 13,117 prime numbers less than or equal to 141,738.

## Divisibility of 141738

 m n mod m 2 3 4 5 6 7 8 9 0 0 2 3 0 2 2 6

The number 141,738 is divisible by 2, 3 and 6.

## Classification of 141738

• Arithmetic
• Abundant

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

• Sphenic

## Base conversion (141738)

Base System Value
2 Binary 100010100110101010
3 Ternary 21012102120
4 Quaternary 202212222
5 Quinary 14013423
6 Senary 3012110
8 Octal 424652
10 Decimal 141738
12 Duodecimal 6a036
20 Vigesimal he6i
36 Base36 31d6

## Basic calculations (n = 141738)

### Multiplication

n×y
 n×2 283476 425214 566952 708690

### Division

n÷y
 n÷2 70869 47246 35434.5 28347.6

### Exponentiation

ny
 n2 20089660644 2847468320359272 403594464791082494736 57204672250558450638891168

### Nth Root

y√n
 2√n 376.481 52.1389 19.4031 10.7225

## 141738 as geometric shapes

### Circle

 Diameter 283476 890566 6.31135e+10

### Sphere

 Volume 1.19274e+16 2.52454e+11 890566

### Square

Length = n
 Perimeter 566952 2.00897e+10 200448

### Cube

Length = n
 Surface area 1.20538e+11 2.84747e+15 245497

### Equilateral Triangle

Length = n
 Perimeter 425214 8.69908e+09 122749

### Triangular Pyramid

Length = n
 Surface area 3.47963e+10 3.35577e+14 115729

## Cryptographic Hash Functions

md5 38e1a540f3edab802717a06244236800 c5065c829fed3cb2108647bb1889f305240c561a 76195fd29757b90bb28af86093c05fc195d6a02966e3ebb2207463269b53490a 44a11531ccd999a1e8c0c426066e095d5ea6f8829ac9c6b790b8f5537ceeab79409b5194f61df016a998ad71e80f7c63da7b07971d6d6dc76b6af4011677ea89 b88319679779d18c82f64e2e54fbd3e8d9473375
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}