Base | Representation |
---|---|
bin | 110011001111001011… |
… | …1100010111101101011 |
3 | 101112000021000211001212 |
4 | 1212132113202331223 |
5 | 3300320433430201 |
6 | 122314141303335 |
7 | 10643450246336 |
oct | 1463627427553 |
9 | 345007024055 |
10 | 110031155051 |
11 | 4273379a394 |
12 | 193a9264b4b |
13 | a4b6ab784c |
14 | 547b3b361d |
15 | 2cdebedabb |
hex | 199e5e2f6b |
110031155051 has 2 divisors, whose sum is σ = 110031155052. Its totient is φ = 110031155050.
The previous prime is 110031155041. The next prime is 110031155071. The reversal of 110031155051 is 150551130011.
It is a weak prime.
It is an emirp because it is prime and its reverse (150551130011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110031155051 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (110031155021) 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, 55015577525 + 55015577526.
It is an arithmetic number, because the mean of its divisors is an integer number (55015577526).
Almost surely, 2110031155051 is an apocalyptic number.
110031155051 is a deficient number, since it is larger than the sum of its proper divisors (1).
110031155051 is an equidigital number, since it uses as much as digits as its factorization.
110031155051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 375, while the sum is 23.
Adding to 110031155051 its reverse (150551130011), we get a palindrome (260582285062).
The spelling of 110031155051 in words is "one hundred ten billion, thirty-one million, one hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •