Base | Representation |
---|---|
bin | 1001001100100010110010… |
… | …0110001000111001100011 |
3 | 1022210121112000202111121211 |
4 | 2103020230212020321203 |
5 | 2311130013402211321 |
6 | 33300550433330551 |
7 | 2062334341141201 |
oct | 223105446107143 |
9 | 38717460674554 |
10 | 10111101210211 |
11 | 3249104045711 |
12 | 1173723406a57 |
13 | 58461b83abb1 |
14 | 26d546688071 |
15 | 12802da600e1 |
hex | 9322c988e63 |
10111101210211 has 2 divisors, whose sum is σ = 10111101210212. Its totient is φ = 10111101210210.
The previous prime is 10111101210173. The next prime is 10111101210227. The reversal of 10111101210211 is 11201210111101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10111101210211 - 213 = 10111101202019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111101210191 and 10111101210200.
It is not a weakly prime, because it can be changed into another prime (10111101210011) 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, 5055550605105 + 5055550605106.
It is an arithmetic number, because the mean of its divisors is an integer number (5055550605106).
Almost surely, 210111101210211 is an apocalyptic number.
10111101210211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111101210211 is an equidigital number, since it uses as much as digits as its factorization.
10111101210211 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 13.
Adding to 10111101210211 its reverse (11201210111101), we get a palindrome (21312311321312).
The spelling of 10111101210211 in words is "ten trillion, one hundred eleven billion, one hundred one million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •