Base | Representation |
---|---|
bin | 1001000110000100111100… |
… | …0010110011011011101111 |
3 | 1022101222202220001022101212 |
4 | 2101201033002303123233 |
5 | 2302320010030000421 |
6 | 33133535143225035 |
7 | 2051322366344165 |
oct | 221411702633357 |
9 | 38358686038355 |
10 | 10000010000111 |
11 | 3205a86a4427a |
12 | 115609b14817b |
13 | 576cc624a151 |
14 | 2680085b3235 |
15 | 1251cac6ae5b |
hex | 9184f0b36ef |
10000010000111 has 2 divisors, whose sum is σ = 10000010000112. Its totient is φ = 10000010000110.
The previous prime is 10000010000081. The next prime is 10000010000119. The reversal of 10000010000111 is 11100001000001.
It is a strong prime.
It is an emirp because it is prime and its reverse (11100001000001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10000010000111 - 26 = 10000010000047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10000010000095 and 10000010000104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000010000119) 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, 5000005000055 + 5000005000056.
It is an arithmetic number, because the mean of its divisors is an integer number (5000005000056).
Almost surely, 210000010000111 is an apocalyptic number.
10000010000111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000010000111 is an equidigital number, since it uses as much as digits as its factorization.
10000010000111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10000010000111 its reverse (11100001000001), we get a palindrome (21100011000112).
The spelling of 10000010000111 in words is "ten trillion, ten million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •