Base | Representation |
---|---|
bin | 1001000110101101111001… |
… | …10011010000011101000010 |
3 | 2121220002022022101110011110 |
4 | 10203112330303100131002 |
5 | 10111020034042320002 |
6 | 110325552351224150 |
7 | 4134354034656642 |
oct | 443267463203502 |
9 | 77802268343143 |
10 | 20022010120002 |
11 | 641a317815a60 |
12 | 22b4496818056 |
13 | b230b526a097 |
14 | 4d30db4b4522 |
15 | 24ac42312e6c |
hex | 1235bccd0742 |
20022010120002 has 64 divisors (see below), whose sum is σ = 43928423884800. Its totient is φ = 6033385713600.
The previous prime is 20022010119971. The next prime is 20022010120033. The reversal of 20022010120002 is 20002101022002.
It is an interprime number because it is at equal distance from previous prime (20022010119971) and next prime (20022010120033).
It is a self number, because there is not a number n which added to its sum of digits gives 20022010120002.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 243645373 + ... + 243727535.
It is an arithmetic number, because the mean of its divisors is an integer number (686381623200).
Almost surely, 220022010120002 is an apocalyptic number.
20022010120002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20022010120002 is an abundant number, since it is smaller than the sum of its proper divisors (23906413764798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022010120002 is a wasteful number, since it uses less digits than its factorization.
20022010120002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102759.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20022010120002 its reverse (20002101022002), we get a palindrome (40024111142004).
The spelling of 20022010120002 in words is "twenty trillion, twenty-two billion, ten million, one hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •