Base | Representation |
---|---|
bin | 1001010001110010000100… |
… | …0000011110101110111011 |
3 | 1100010012211021102201022202 |
4 | 2110130201000132232323 |
5 | 2314113323340231021 |
6 | 33410153211340415 |
7 | 2102001536454251 |
oct | 224344100365673 |
9 | 40105737381282 |
10 | 10201101102011 |
11 | 32832986a2486 |
12 | 118906015170b |
13 | 58cc62622b41 |
14 | 273a435585d1 |
15 | 12a549db9a0b |
hex | 9472101ebbb |
10201101102011 has 2 divisors, whose sum is σ = 10201101102012. Its totient is φ = 10201101102010.
The previous prime is 10201101101969. The next prime is 10201101102083. The reversal of 10201101102011 is 11020110110201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10201101102011 - 226 = 10201033993147 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10201101101983 and 10201101102001.
It is not a weakly prime, because it can be changed into another prime (10201101101011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100550551005 + 5100550551006.
It is an arithmetic number, because the mean of its divisors is an integer number (5100550551006).
Almost surely, 210201101102011 is an apocalyptic number.
10201101102011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201101102011 is an equidigital number, since it uses as much as digits as its factorization.
10201101102011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10201101102011 its reverse (11020110110201), we get a palindrome (21221211212212).
The spelling of 10201101102011 in words is "ten trillion, two hundred one billion, one hundred one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •