Base | Representation |
---|---|
bin | 110011001111001011… |
… | …1011000001101100101 |
3 | 101112000020221120122211 |
4 | 1212132113120031211 |
5 | 3300320431023023 |
6 | 122314140323421 |
7 | 10643450004055 |
oct | 1463627301545 |
9 | 345006846584 |
10 | 110031111013 |
11 | 4273376a29a |
12 | 193a9243571 |
13 | a4b6aa07a5 |
14 | 547b3a1565 |
15 | 2cdebe0a0d |
hex | 199e5d8365 |
110031111013 has 2 divisors, whose sum is σ = 110031111014. Its totient is φ = 110031111012.
The previous prime is 110031110993. The next prime is 110031111017. The reversal of 110031111013 is 310111130011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74656272289 + 35374838724 = 273233^2 + 188082^2 .
It is a cyclic number.
It is not a de Polignac number, because 110031111013 - 217 = 110030979941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110031110984 and 110031111002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110031111017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55015555506 + 55015555507.
It is an arithmetic number, because the mean of its divisors is an integer number (55015555507).
Almost surely, 2110031111013 is an apocalyptic number.
It is an amenable number.
110031111013 is a deficient number, since it is larger than the sum of its proper divisors (1).
110031111013 is an equidigital number, since it uses as much as digits as its factorization.
110031111013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 110031111013 its reverse (310111130011), we get a palindrome (420142241024).
The spelling of 110031111013 in words is "one hundred ten billion, thirty-one million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •