Base | Representation |
---|---|
bin | 101110100111100010… |
… | …1100100101111000001 |
3 | 100120101220201021012222 |
4 | 1131033011210233001 |
5 | 3120011420442212 |
6 | 113553532300425 |
7 | 10142563246421 |
oct | 1351705445701 |
9 | 316356637188 |
10 | 100111109057 |
11 | 39503124a73 |
12 | 1749b011715 |
13 | 959584284b |
14 | 4bb9b04481 |
15 | 290dd85c72 |
hex | 174f164bc1 |
100111109057 has 2 divisors, whose sum is σ = 100111109058. Its totient is φ = 100111109056.
The previous prime is 100111109053. The next prime is 100111109083. The reversal of 100111109057 is 750901111001.
It is an a-pointer prime, because the next prime (100111109083) can be obtained adding 100111109057 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77395796401 + 22715312656 = 278201^2 + 150716^2 .
It is a cyclic number.
It is not a de Polignac number, because 100111109057 - 22 = 100111109053 is a prime.
It is not a weakly prime, because it can be changed into another prime (100111109053) 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, 50055554528 + 50055554529.
It is an arithmetic number, because the mean of its divisors is an integer number (50055554529).
Almost surely, 2100111109057 is an apocalyptic number.
It is an amenable number.
100111109057 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111109057 is an equidigital number, since it uses as much as digits as its factorization.
100111109057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 315, while the sum is 26.
The spelling of 100111109057 in words is "one hundred billion, one hundred eleven million, one hundred nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •