Base | Representation |
---|---|
bin | 1001001001010101110001… |
… | …00011111010101011011010 |
3 | 2122012200221011001111121010 |
4 | 10210222320203322223122 |
5 | 10114004122111144002 |
6 | 110435215251554350 |
7 | 4144024261252416 |
oct | 444527043725332 |
9 | 78180834044533 |
10 | 20112133303002 |
11 | 6454564a22284 |
12 | 2309a488bb9b6 |
13 | b2b74875bcc0 |
14 | 4d760a8b9d46 |
15 | 24d2693c346c |
hex | 124ab88faada |
20112133303002 has 32 divisors (see below), whose sum is σ = 43329236162688. Its totient is φ = 6186806536896.
The previous prime is 20112133302991. The next prime is 20112133303013. The reversal of 20112133303002 is 20030333121102.
It is an interprime number because it is at equal distance from previous prime (20112133302991) and next prime (20112133303013).
It is a self number, because there is not a number n which added to its sum of digits gives 20112133303002.
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, 31813558 + ... + 32439585.
It is an arithmetic number, because the mean of its divisors is an integer number (1354038630084).
Almost surely, 220112133303002 is an apocalyptic number.
20112133303002 is an abundant number, since it is smaller than the sum of its proper divisors (23217102859686).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112133303002 is a wasteful number, since it uses less digits than its factorization.
20112133303002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64257174.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 20112133303002 its reverse (20030333121102), we get a palindrome (40142466424104).
The spelling of 20112133303002 in words is "twenty trillion, one hundred twelve billion, one hundred thirty-three million, three hundred three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •