Base | Representation |
---|---|
bin | 10000001001110111001… |
… | …011010000001101000101 |
3 | 10221010100211212210012222 |
4 | 100021313023100031011 |
5 | 121141441324013104 |
6 | 2205550125022125 |
7 | 143126223551066 |
oct | 20116713201505 |
9 | 3833324783188 |
10 | 1110101001029 |
11 | 398878090629 |
12 | 15b18a6b4945 |
13 | 808b3699a67 |
14 | 3ba2cbdc56d |
15 | 1dd226601be |
hex | 102772d0345 |
1110101001029 has 2 divisors, whose sum is σ = 1110101001030. Its totient is φ = 1110101001028.
The previous prime is 1110101000941. The next prime is 1110101001059. The reversal of 1110101001029 is 9201001010111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1109799040900 + 301960129 = 1053470^2 + 17377^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110101001029 - 212 = 1110100996933 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1110101000998 and 1110101001016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110101001059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555050500514 + 555050500515.
It is an arithmetic number, because the mean of its divisors is an integer number (555050500515).
Almost surely, 21110101001029 is an apocalyptic number.
It is an amenable number.
1110101001029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110101001029 is an equidigital number, since it uses as much as digits as its factorization.
1110101001029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 17.
The spelling of 1110101001029 in words is "one trillion, one hundred ten billion, one hundred one million, one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •