## 20049

20,049 (twenty thousand forty-nine) is an odd five-digits composite number following 20048 and preceding 20050. In scientific notation, it is written as 2.0049 × 104. The sum of its digits is 15. It has a total of 3 prime factors and 8 positive divisors. There are 12,960 positive integers (up to 20049) that are relatively prime to 20049.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 15
• Digital Root 6

## Name

Short name 20 thousand 49 twenty thousand forty-nine

## Notation

Scientific notation 2.0049 × 104 20.049 × 103

## Prime Factorization of 20049

Prime Factorization 3 × 41 × 163

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 20049 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 20,049 is 3 × 41 × 163. Since it has a total of 3 prime factors, 20,049 is a composite number.

## Divisors of 20049

1, 3, 41, 123, 163, 489, 6683, 20049

8 divisors

 Even divisors 0 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 27552 Sum of all the positive divisors of n s(n) 7503 Sum of the proper positive divisors of n A(n) 3444 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 141.594 Returns the nth root of the product of n divisors H(n) 5.82143 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 20,049 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 20,049) is 27,552, the average is 3,444.

## Other Arithmetic Functions (n = 20049)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 12960 Total number of positive integers not greater than n that are coprime to n λ(n) 3240 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 2271 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 12,960 positive integers (less than 20,049) that are coprime with 20,049. And there are approximately 2,271 prime numbers less than or equal to 20,049.

## Divisibility of 20049

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

The number 20,049 is divisible by 3.

## Classification of 20049

• Arithmetic
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (20049)

Base System Value
2 Binary 100111001010001
3 Ternary 1000111120
4 Quaternary 10321101
5 Quinary 1120144
6 Senary 232453
8 Octal 47121
10 Decimal 20049
12 Duodecimal b729
20 Vigesimal 2a29
36 Base36 fgx

## Basic calculations (n = 20049)

### Multiplication

n×i
 n×2 40098 60147 80196 100245

### Division

ni
 n⁄2 10024.5 6683 5012.25 4009.8

### Exponentiation

ni
 n2 401962401 8058944177649 161573771817684801 3239392551172762575249

### Nth Root

i√n
 2√n 141.594 27.1663 11.8993 7.25134

## 20049 as geometric shapes

### Circle

 Diameter 40098 125972 1.2628e+09

### Sphere

 Volume 3.37572e+13 5.05121e+09 125972

### Square

Length = n
 Perimeter 80196 4.01962e+08 28353.6

### Cube

Length = n
 Surface area 2.41177e+09 8.05894e+12 34725.9

### Equilateral Triangle

Length = n
 Perimeter 60147 1.74055e+08 17362.9

### Triangular Pyramid

Length = n
 Surface area 6.96219e+08 9.49756e+11 16369.9

## Cryptographic Hash Functions

md5 f9d15850234291f8df6f03c468fb5cc7 b2e9e9dd348ff37a681303126d62eac2149e73c8 3b6bb6bdbfe2de241f81901cb5c52b61fcbd8effbe5e90d5393725e5c00d88f5 4a53cfdda58d3087d993919a62ba7748ddb7977f0a357635219ca12857215bc3b08656342403282c97525d4a97327ff1052e58d4e7efc94fa6408ca59f7076dd fe9fa5122e3eda6f4aeac20bb0d964a01c812a2f
{"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}