Base | Representation |
---|---|
bin | 100110110100… |
… | …0110001111001 |
3 | 1102021222212021 |
4 | 1031220301321 |
5 | 20202231441 |
6 | 2004114441 |
7 | 334663426 |
oct | 115506171 |
9 | 42258767 |
10 | 20352121 |
11 | 10540939 |
12 | 6995a21 |
13 | 42a779a |
14 | 29bad4d |
15 | 1bc03d1 |
hex | 1368c79 |
20352121 has 8 divisors (see below), whose sum is σ = 20783520. Its totient is φ = 19924608.
The previous prime is 20352119. The next prime is 20352127. The reversal of 20352121 is 12125302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20352121 - 21 = 20352119 is a prime.
It is a super-3 number, since 3×203521213 (a number of 23 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20352095 and 20352104.
It is not an unprimeable number, because it can be changed into a prime (20352127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11145 + ... + 12841.
It is an arithmetic number, because the mean of its divisors is an integer number (2597940).
Almost surely, 220352121 is an apocalyptic number.
It is an amenable number.
20352121 is a deficient number, since it is larger than the sum of its proper divisors (431399).
20352121 is a wasteful number, since it uses less digits than its factorization.
20352121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1943.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 20352121 is about 4511.3325082507. The cubic root of 20352121 is about 273.0255089386.
Adding to 20352121 its reverse (12125302), we get a palindrome (32477423).
The spelling of 20352121 in words is "twenty million, three hundred fifty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •