Base | Representation |
---|---|
bin | 101111101111111011100111… |
… | …110011111011110110011100 |
3 | 1000112112222220212002010211120 |
4 | 233233323213303323312130 |
5 | 210011133114122401022 |
6 | 2022345332440450540 |
7 | 62143100553511506 |
oct | 5757734763736634 |
9 | 1015488825063746 |
10 | 210002020122012 |
11 | 60a053a1687998 |
12 | 1b67796b779a50 |
13 | 902414aab8571 |
14 | 39c021b168d76 |
15 | 194297b51bd5c |
hex | befee7cfbd9c |
210002020122012 has 12 divisors (see below), whose sum is σ = 490004713618056. Its totient is φ = 70000673374000.
The previous prime is 210002020121911. The next prime is 210002020122049. The reversal of 210002020122012 is 210221020200012.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 210002020121982 and 210002020122000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8750084171739 + ... + 8750084171762.
It is an arithmetic number, because the mean of its divisors is an integer number (40833726134838).
Almost surely, 2210002020122012 is an apocalyptic number.
It is an amenable number.
210002020122012 is an abundant number, since it is smaller than the sum of its proper divisors (280002693496044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210002020122012 is a wasteful number, since it uses less digits than its factorization.
210002020122012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17500168343508 (or 17500168343506 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 210002020122012 its reverse (210221020200012), we get a palindrome (420223040322024).
The spelling of 210002020122012 in words is "two hundred ten trillion, two billion, twenty million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •