Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1000101011100100101 |
3 | 101111221002121010010122 |
4 | 1212130201011130211 |
5 | 3300240011214112 |
6 | 122311111531325 |
7 | 10642622301242 |
oct | 1463441053445 |
9 | 344832533118 |
10 | 110000101157 |
11 | 4271820a111 |
12 | 1939a989b45 |
13 | a4b0533c6b |
14 | 547720c5c9 |
15 | 2cdc117872 |
hex | 199c845725 |
110000101157 has 2 divisors, whose sum is σ = 110000101158. Its totient is φ = 110000101156.
The previous prime is 110000101147. The next prime is 110000101181. The reversal of 110000101157 is 751101000011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101174250241 + 8825850916 = 318079^2 + 93946^2 .
It is a cyclic number.
It is not a de Polignac number, because 110000101157 - 212 = 110000097061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110000101147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000050578 + 55000050579.
It is an arithmetic number, because the mean of its divisors is an integer number (55000050579).
Almost surely, 2110000101157 is an apocalyptic number.
It is an amenable number.
110000101157 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000101157 is an equidigital number, since it uses as much as digits as its factorization.
110000101157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35, while the sum is 17.
Adding to 110000101157 its reverse (751101000011), we get a palindrome (861101101168).
The spelling of 110000101157 in words is "one hundred ten billion, one hundred one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •