Base | Representation |
---|---|
bin | 1001000111010111010001… |
… | …0011111111101010001111 |
3 | 1022111002211002021201021002 |
4 | 2101311310103333222033 |
5 | 2303200240141200421 |
6 | 33152032133130515 |
7 | 2053034142162464 |
oct | 221656423775217 |
9 | 38432732251232 |
10 | 10022110100111 |
11 | 321439796a52a |
12 | 115a428489a3b |
13 | 579108a492b5 |
14 | 26910376d66b |
15 | 125a7106db0b |
hex | 91d744ffa8f |
10022110100111 has 2 divisors, whose sum is σ = 10022110100112. Its totient is φ = 10022110100110.
The previous prime is 10022110100083. The next prime is 10022110100113. The reversal of 10022110100111 is 11100101122001.
It is a strong prime.
It is an emirp because it is prime and its reverse (11100101122001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10022110100111 - 218 = 10022109837967 is a prime.
Together with 10022110100113, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10022110100092 and 10022110100101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10022110100113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011055050055 + 5011055050056.
It is an arithmetic number, because the mean of its divisors is an integer number (5011055050056).
Almost surely, 210022110100111 is an apocalyptic number.
10022110100111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022110100111 is an equidigital number, since it uses as much as digits as its factorization.
10022110100111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10022110100111 its reverse (11100101122001), we get a palindrome (21122211222112).
The spelling of 10022110100111 in words is "ten trillion, twenty-two billion, one hundred ten million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •