Base | Representation |
---|---|
bin | 10110101111010101101010… |
… | …011111011000110000001111 |
3 | 111010002212112211102202221121 |
4 | 112233111222133120300033 |
5 | 101102031141111200421 |
6 | 552412001122541411 |
7 | 30031330340444245 |
oct | 2657255237306017 |
9 | 433085484382847 |
10 | 100010100100111 |
11 | 29959055280953 |
12 | b272764207867 |
13 | 43a5bb17b0646 |
14 | 1a9a72c390795 |
15 | b8675b351d41 |
hex | 5af56a7d8c0f |
100010100100111 has 2 divisors, whose sum is σ = 100010100100112. Its totient is φ = 100010100100110.
The previous prime is 100010100100093. The next prime is 100010100100153. The reversal of 100010100100111 is 111001001010001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100010100100111 - 29 = 100010100099599 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100010100100094 and 100010100100103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100010100101111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005050050055 + 50005050050056.
It is an arithmetic number, because the mean of its divisors is an integer number (50005050050056).
Almost surely, 2100010100100111 is an apocalyptic number.
100010100100111 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010100100111 is an equidigital number, since it uses as much as digits as its factorization.
100010100100111 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 7.
Adding to 100010100100111 its reverse (111001001010001), we get a palindrome (211011101110112).
The spelling of 100010100100111 in words is "one hundred trillion, ten billion, one hundred million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •