Base | Representation |
---|---|
bin | 101111000101010101… |
… | …1011011101010111011 |
3 | 100122222120222100200012 |
4 | 1132022223123222323 |
5 | 3124033341423042 |
6 | 114241045132135 |
7 | 10206423243242 |
oct | 1361253335273 |
9 | 318876870605 |
10 | 101110889147 |
11 | 39976508604 |
12 | 177199ba04b |
13 | 96c4a038b8 |
14 | 4c727d5959 |
15 | 296ba21e82 |
hex | 178aadbabb |
101110889147 has 2 divisors, whose sum is σ = 101110889148. Its totient is φ = 101110889146.
The previous prime is 101110889141. The next prime is 101110889149. The reversal of 101110889147 is 741988011101.
It is a strong prime.
It is an emirp because it is prime and its reverse (741988011101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101110889147 - 28 = 101110888891 is a prime.
Together with 101110889149, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101110889141) 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, 50555444573 + 50555444574.
It is an arithmetic number, because the mean of its divisors is an integer number (50555444574).
Almost surely, 2101110889147 is an apocalyptic number.
101110889147 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110889147 is an equidigital number, since it uses as much as digits as its factorization.
101110889147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 41.
The spelling of 101110889147 in words is "one hundred one billion, one hundred ten million, eight hundred eighty-nine thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •