Base | Representation |
---|---|
bin | 101110100111100000… |
… | …1101110011010111111 |
3 | 100120101211211000021101 |
4 | 1131033001232122333 |
5 | 3120011141201114 |
6 | 113553454513531 |
7 | 10142551545136 |
oct | 1351701563277 |
9 | 316354730241 |
10 | 100110100159 |
11 | 395025a5a73 |
12 | 1749a8058a7 |
13 | 959557b574 |
14 | 4bb992091d |
15 | 290dc36d74 |
hex | 174f06e6bf |
100110100159 has 2 divisors, whose sum is σ = 100110100160. Its totient is φ = 100110100158.
The previous prime is 100110100091. The next prime is 100110100169. The reversal of 100110100159 is 951001011001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100110100159 - 27 = 100110100031 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100110100169) 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, 50055050079 + 50055050080.
It is an arithmetic number, because the mean of its divisors is an integer number (50055050080).
Almost surely, 2100110100159 is an apocalyptic number.
100110100159 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110100159 is an equidigital number, since it uses as much as digits as its factorization.
100110100159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45, while the sum is 19.
The spelling of 100110100159 in words is "one hundred billion, one hundred ten million, one hundred thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •