Base | Representation |
---|---|
bin | 101110100111100010… |
… | …1001010101000001111 |
3 | 100120101220111211112121 |
4 | 1131033011022220033 |
5 | 3120011404032002 |
6 | 113553530113411 |
7 | 10142562322603 |
oct | 1351705125017 |
9 | 316356454477 |
10 | 100111002127 |
11 | 395030616a4 |
12 | 1749ab7b867 |
13 | 9595805c86 |
14 | 4bb9ab7503 |
15 | 290dd64237 |
hex | 174f14aa0f |
100111002127 has 2 divisors, whose sum is σ = 100111002128. Its totient is φ = 100111002126.
The previous prime is 100111002073. The next prime is 100111002151. The reversal of 100111002127 is 721200111001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100111002127 - 27 = 100111001999 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100111002127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100111002197) 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, 50055501063 + 50055501064.
It is an arithmetic number, because the mean of its divisors is an integer number (50055501064).
Almost surely, 2100111002127 is an apocalyptic number.
100111002127 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111002127 is an equidigital number, since it uses as much as digits as its factorization.
100111002127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 100111002127 its reverse (721200111001), we get a palindrome (821311113128).
The spelling of 100111002127 in words is "one hundred billion, one hundred eleven million, two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •