Base | Representation |
---|---|
bin | 10110110010000110100010… |
… | …001000001101110100010111 |
3 | 111010210000202010101112010101 |
4 | 112302012202020031310113 |
5 | 101113134111100024002 |
6 | 553035130004234531 |
7 | 30051132465060535 |
oct | 2662064210156427 |
9 | 433700663345111 |
10 | 100200012111127 |
11 | 29a2164a69a675 |
12 | b2a352539ba47 |
13 | 43baa88b15866 |
14 | 1aa59c6767155 |
15 | b8b673d37587 |
hex | 5b21a220dd17 |
100200012111127 has 2 divisors, whose sum is σ = 100200012111128. Its totient is φ = 100200012111126.
The previous prime is 100200012111029. The next prime is 100200012111217. The reversal of 100200012111127 is 721111210002001.
Together with next prime (100200012111217) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100200012111127 - 219 = 100200011586839 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100200012181127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50100006055563 + 50100006055564.
It is an arithmetic number, because the mean of its divisors is an integer number (50100006055564).
Almost surely, 2100200012111127 is an apocalyptic number.
100200012111127 is a deficient number, since it is larger than the sum of its proper divisors (1).
100200012111127 is an equidigital number, since it uses as much as digits as its factorization.
100200012111127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 100200012111127 its reverse (721111210002001), we get a palindrome (821311222113128).
The spelling of 100200012111127 in words is "one hundred trillion, two hundred billion, twelve million, one hundred eleven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •