Base | Representation |
---|---|
bin | 110011001111001011… |
… | …1011000001101010001 |
3 | 101112000020221120122002 |
4 | 1212132113120031101 |
5 | 3300320431022433 |
6 | 122314140323345 |
7 | 10643450004026 |
oct | 1463627301521 |
9 | 345006846562 |
10 | 110031110993 |
11 | 4273376a281 |
12 | 193a9243555 |
13 | a4b6aa078b |
14 | 547b3a154d |
15 | 2cdebe09e8 |
hex | 199e5d8351 |
110031110993 has 2 divisors, whose sum is σ = 110031110994. Its totient is φ = 110031110992.
The previous prime is 110031110977. The next prime is 110031111013. The reversal of 110031110993 is 399011130011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80751452224 + 29279658769 = 284168^2 + 171113^2 .
It is a cyclic number.
It is not a de Polignac number, because 110031110993 - 24 = 110031110977 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (110031110593) 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, 55015555496 + 55015555497.
It is an arithmetic number, because the mean of its divisors is an integer number (55015555497).
Almost surely, 2110031110993 is an apocalyptic number.
It is an amenable number.
110031110993 is a deficient number, since it is larger than the sum of its proper divisors (1).
110031110993 is an equidigital number, since it uses as much as digits as its factorization.
110031110993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 29.
The spelling of 110031110993 in words is "one hundred ten billion, thirty-one million, one hundred ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •