Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …001110010000001010001 |
3 | 10221010101112212220210022 |
4 | 100021313301302001101 |
5 | 121142001420213014 |
6 | 2205551125313225 |
7 | 143126405445101 |
oct | 20116761620121 |
9 | 3833345786708 |
10 | 1110111101009 |
11 | 398882859919 |
12 | 15b191b65815 |
13 | 808b57c4c91 |
14 | 3ba302ab201 |
15 | 1dd234a7a8e |
hex | 10277c72051 |
1110111101009 has 2 divisors, whose sum is σ = 1110111101010. Its totient is φ = 1110111101008.
The previous prime is 1110111100999. The next prime is 1110111101059. The reversal of 1110111101009 is 9001011110111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1063992250000 + 46118851009 = 1031500^2 + 214753^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110111101009 - 220 = 1110110052433 is a prime.
It is not a weakly prime, because it can be changed into another prime (1110111101059) 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, 555055550504 + 555055550505.
It is an arithmetic number, because the mean of its divisors is an integer number (555055550505).
Almost surely, 21110111101009 is an apocalyptic number.
It is an amenable number.
1110111101009 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110111101009 is an equidigital number, since it uses as much as digits as its factorization.
1110111101009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 17.
The spelling of 1110111101009 in words is "one trillion, one hundred ten billion, one hundred eleven million, one hundred one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •