Base | Representation |
---|---|
bin | 101110100111100000… |
… | …1101110101010100001 |
3 | 100120101211211001122012 |
4 | 1131033001232222201 |
5 | 3120011141214103 |
6 | 113553454522305 |
7 | 10142551551056 |
oct | 1351701565241 |
9 | 316354731565 |
10 | 100110101153 |
11 | 395025a6797 |
12 | 1749a806395 |
13 | 959557bb5a |
14 | 4bb992102d |
15 | 290dc372d8 |
hex | 174f06eaa1 |
100110101153 has 2 divisors, whose sum is σ = 100110101154. Its totient is φ = 100110101152.
The previous prime is 100110101111. The next prime is 100110101197. The reversal of 100110101153 is 351101011001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96532625809 + 3577475344 = 310697^2 + 59812^2 .
It is a cyclic number.
It is not a de Polignac number, because 100110101153 - 218 = 100109839009 is a prime.
It is not a weakly prime, because it can be changed into another prime (100110101353) 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, 50055050576 + 50055050577.
It is an arithmetic number, because the mean of its divisors is an integer number (50055050577).
Almost surely, 2100110101153 is an apocalyptic number.
It is an amenable number.
100110101153 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110101153 is an equidigital number, since it uses as much as digits as its factorization.
100110101153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15, while the sum is 14.
Adding to 100110101153 its reverse (351101011001), we get a palindrome (451211112154).
The spelling of 100110101153 in words is "one hundred billion, one hundred ten million, one hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •