Base | Representation |
---|---|
bin | 1001000110001000110100… |
… | …01011110100000101100101 |
3 | 2121211011220212202021100110 |
4 | 10203010122023310011211 |
5 | 10110203301103031041 |
6 | 110312501103203233 |
7 | 4133050506524436 |
oct | 443043213640545 |
9 | 77734825667313 |
10 | 20002102002021 |
11 | 6411931143297 |
12 | 22b065b5a6519 |
13 | b21261922c09 |
14 | 4d216d4a948d |
15 | 24a479696516 |
hex | 12311a2f4165 |
20002102002021 has 32 divisors (see below), whose sum is σ = 28456899803136. Its totient is φ = 12453493760000.
The previous prime is 20002102001971. The next prime is 20002102002037. The reversal of 20002102002021 is 12020020120002.
It is a cyclic number.
It is not a de Polignac number, because 20002102002021 - 213 = 20002101993829 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20002102001988 and 20002102002006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002102402021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1345801 + ... + 6466481.
It is an arithmetic number, because the mean of its divisors is an integer number (889278118848).
Almost surely, 220002102002021 is an apocalyptic number.
It is an amenable number.
20002102002021 is a deficient number, since it is larger than the sum of its proper divisors (8454797801115).
20002102002021 is a wasteful number, since it uses less digits than its factorization.
20002102002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5121293.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20002102002021 its reverse (12020020120002), we get a palindrome (32022122122023).
The spelling of 20002102002021 in words is "twenty trillion, two billion, one hundred two million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •