Base | Representation |
---|---|
bin | 1001001011111101111010… |
… | …0011101100010001000001 |
3 | 1022202122222010200002110110 |
4 | 2102333132203230101001 |
5 | 2310444230203324301 |
6 | 33252232251221533 |
7 | 2061534126265530 |
oct | 222773643542101 |
9 | 38678863602413 |
10 | 10101202011201 |
11 | 3244994219a04 |
12 | 11718201478a9 |
13 | 5837019b49a2 |
14 | 26cc87a84317 |
15 | 127b4e9640d6 |
hex | 92fde8ec441 |
10101202011201 has 64 divisors (see below), whose sum is σ = 15932604796416. Its totient is φ = 5572509696000.
The previous prime is 10101202011193. The next prime is 10101202011221. The reversal of 10101202011201 is 10211020210101.
10101202011201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10101202011201 - 23 = 10101202011193 is a prime.
It is a super-2 number, since 2×101012020112012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10101202011221) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 162846945 + ... + 162908961.
It is an arithmetic number, because the mean of its divisors is an integer number (248946949944).
Almost surely, 210101202011201 is an apocalyptic number.
It is an amenable number.
10101202011201 is a deficient number, since it is larger than the sum of its proper divisors (5831402785215).
10101202011201 is a wasteful number, since it uses less digits than its factorization.
10101202011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64042.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10101202011201 its reverse (10211020210101), we get a palindrome (20312222221302).
The spelling of 10101202011201 in words is "ten trillion, one hundred one billion, two hundred two million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •