Base | Representation |
---|---|
bin | 1001010001110010011110… |
… | …0011110010001011100010 |
3 | 1100010020002221021010110110 |
4 | 2110130213203302023202 |
5 | 2314114040010120002 |
6 | 33410212135312150 |
7 | 2102004342655002 |
oct | 224344743621342 |
9 | 40106087233413 |
10 | 10201211020002 |
11 | 32833447484a2 |
12 | 1189090b1b656 |
13 | 58cc7c329a82 |
14 | 273a53dac002 |
15 | 12a55487ce6c |
hex | 947278f22e2 |
10201211020002 has 64 divisors (see below), whose sum is σ = 22057666254720. Its totient is φ = 3134228027904.
The previous prime is 10201211019917. The next prime is 10201211020073. The reversal of 10201211020002 is 20002011210201.
It is a super-2 number, since 2×102012110200022 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10201211020002.
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, 130858228 + ... + 130936160.
It is an arithmetic number, because the mean of its divisors is an integer number (344651035230).
Almost surely, 210201211020002 is an apocalyptic number.
10201211020002 is an abundant number, since it is smaller than the sum of its proper divisors (11856455234718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201211020002 is a wasteful number, since it uses less digits than its factorization.
10201211020002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109027.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10201211020002 its reverse (20002011210201), we get a palindrome (30203222230203).
The spelling of 10201211020002 in words is "ten trillion, two hundred one billion, two hundred eleven million, twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •