Base | Representation |
---|---|
bin | 10000001001110111101… |
… | …101100101111101010101 |
3 | 10221010101110211010122101 |
4 | 100021313231211331111 |
5 | 121142001130044104 |
6 | 2205551050002101 |
7 | 143126363223016 |
oct | 20116755457525 |
9 | 3833343733571 |
10 | 1110110003029 |
11 | 3988821799a5 |
12 | 15b191716331 |
13 | 808b54cc2a1 |
14 | 3ba300a300d |
15 | 1dd2333c5a4 |
hex | 10277b65f55 |
1110110003029 has 2 divisors, whose sum is σ = 1110110003030. Its totient is φ = 1110110003028.
The previous prime is 1110110003027. The next prime is 1110110003081. The reversal of 1110110003029 is 9203000110111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 827535896100 + 282574106929 = 909690^2 + 531577^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110110003029 - 21 = 1110110003027 is a prime.
Together with 1110110003027, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1110110002997 and 1110110003015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110110003027) 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, 555055001514 + 555055001515.
It is an arithmetic number, because the mean of its divisors is an integer number (555055001515).
Almost surely, 21110110003029 is an apocalyptic number.
It is an amenable number.
1110110003029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110110003029 is an equidigital number, since it uses as much as digits as its factorization.
1110110003029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 19.
The spelling of 1110110003029 in words is "one trillion, one hundred ten billion, one hundred ten million, three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •