Base | Representation |
---|---|
bin | 1001010001110010000110… |
… | …0011001110111000001111 |
3 | 1100010012211220120120000212 |
4 | 2110130201203032320033 |
5 | 2314113333203241421 |
6 | 33410154134513035 |
7 | 2102002010056310 |
oct | 224344143167017 |
9 | 40105756516025 |
10 | 10201110212111 |
11 | 32832a2854a95 |
12 | 118906320577b |
13 | 58cc64492630 |
14 | 273a4484a607 |
15 | 12a54aab8e5b |
hex | 947218cee0f |
10201110212111 has 32 divisors (see below), whose sum is σ = 12858384873600. Its totient is φ = 7877889736704.
The previous prime is 10201110212099. The next prime is 10201110212119. The reversal of 10201110212111 is 11121201110201.
It is not a de Polignac number, because 10201110212111 - 210 = 10201110211087 is a prime.
It is a super-2 number, since 2×102011102121112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201110212119) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4548686 + ... + 6410363.
It is an arithmetic number, because the mean of its divisors is an integer number (401824527300).
Almost surely, 210201110212111 is an apocalyptic number.
10201110212111 is a deficient number, since it is larger than the sum of its proper divisors (2657274661489).
10201110212111 is a wasteful number, since it uses less digits than its factorization.
10201110212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10959315.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10201110212111 its reverse (11121201110201), we get a palindrome (21322311322312).
The spelling of 10201110212111 in words is "ten trillion, two hundred one billion, one hundred ten million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •