Base | Representation |
---|---|
bin | 1001000111010011100000… |
… | …1010111101110010110011 |
3 | 1022111000012202200012121102 |
4 | 2101310320022331302303 |
5 | 2303141203340201321 |
6 | 33151344050515015 |
7 | 2053000140626015 |
oct | 221647012756263 |
9 | 38430182605542 |
10 | 10021101100211 |
11 | 3213a1a359a13 |
12 | 115a1a6595a6b |
13 | 578ca79aa836 |
14 | 26904975c1b5 |
15 | 125a126b0c0b |
hex | 91d382bdcb3 |
10021101100211 has 2 divisors, whose sum is σ = 10021101100212. Its totient is φ = 10021101100210.
The previous prime is 10021101100193. The next prime is 10021101100223. The reversal of 10021101100211 is 11200110112001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10021101100211 - 210 = 10021101099187 is a prime.
It is a super-2 number, since 2×100211011002112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10021101100192 and 10021101100201.
It is not a weakly prime, because it can be changed into another prime (10021101100261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010550550105 + 5010550550106.
It is an arithmetic number, because the mean of its divisors is an integer number (5010550550106).
Almost surely, 210021101100211 is an apocalyptic number.
10021101100211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021101100211 is an equidigital number, since it uses as much as digits as its factorization.
10021101100211 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 10021101100211 its reverse (11200110112001), we get a palindrome (21221211212212).
The spelling of 10021101100211 in words is "ten trillion, twenty-one billion, one hundred one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •