Base | Representation |
---|---|
bin | 101111000101010100… |
… | …0000111110001011011 |
3 | 100122222112100021002102 |
4 | 1132022220013301123 |
5 | 3124033131134321 |
6 | 114241014354015 |
7 | 10206412666643 |
oct | 1361250076133 |
9 | 318875307072 |
10 | 101110021211 |
11 | 39975a75501 |
12 | 1771965b90b |
13 | 96c478b824 |
14 | 4c7264b523 |
15 | 296b8eec0b |
hex | 178aa07c5b |
101110021211 has 2 divisors, whose sum is σ = 101110021212. Its totient is φ = 101110021210.
The previous prime is 101110021169. The next prime is 101110021223. The reversal of 101110021211 is 112120011101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101110021211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101110021192 and 101110021201.
It is not a weakly prime, because it can be changed into another prime (101110021261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555010605 + 50555010606.
It is an arithmetic number, because the mean of its divisors is an integer number (50555010606).
Almost surely, 2101110021211 is an apocalyptic number.
101110021211 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110021211 is an equidigital number, since it uses as much as digits as its factorization.
101110021211 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 101110021211 its reverse (112120011101), we get a palindrome (213230032312).
The spelling of 101110021211 in words is "one hundred one billion, one hundred ten million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •