Base | Representation |
---|---|
bin | 1001100011001111011101… |
… | …10101000100100110010110 |
3 | 2202100210002121011121002110 |
4 | 10301213232311010212112 |
5 | 10223044301103000042 |
6 | 112400122113451450 |
7 | 4265231444334603 |
oct | 461475665044626 |
9 | 82323077147073 |
10 | 21002102000022 |
11 | 6767a3a067730 |
12 | 2432421570b86 |
13 | b94649bba870 |
14 | 5287159116aa |
15 | 2664a5e0c09c |
hex | 1319eed44996 |
21002102000022 has 32 divisors (see below), whose sum is σ = 49347596309760. Its totient is φ = 5874713845920.
The previous prime is 21002102000017. The next prime is 21002102000051. The reversal of 21002102000022 is 22000020120012.
It is a junction number, because it is equal to n+sod(n) for n = 21002101999971 and 21002102000007.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12238986322 + ... + 12238988037.
It is an arithmetic number, because the mean of its divisors is an integer number (1542112384680).
Almost surely, 221002102000022 is an apocalyptic number.
21002102000022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21002102000022 is an abundant number, since it is smaller than the sum of its proper divisors (28345494309738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21002102000022 is a wasteful number, since it uses less digits than its factorization.
21002102000022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24477974388.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 21002102000022 its reverse (22000020120012), we get a palindrome (43002122120034).
The spelling of 21002102000022 in words is "twenty-one trillion, two billion, one hundred two million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •