Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …001110010000010000011 |
3 | 10221010101112212220212011 |
4 | 100021313301302002003 |
5 | 121142001420213214 |
6 | 2205551125313351 |
7 | 143126405445202 |
oct | 20116761620203 |
9 | 3833345786764 |
10 | 1110111101059 |
11 | 398882859964 |
12 | 15b191b65857 |
13 | 808b57c4ccc |
14 | 3ba302ab239 |
15 | 1dd234a7ac4 |
hex | 10277c72083 |
1110111101059 has 2 divisors, whose sum is σ = 1110111101060. Its totient is φ = 1110111101058.
The previous prime is 1110111101009. The next prime is 1110111101107. The reversal of 1110111101059 is 9501011110111.
It is a strong prime.
It is an emirp because it is prime and its reverse (9501011110111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110111101059 is a prime.
It is not a weakly prime, because it can be changed into another prime (1110111101009) 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, 555055550529 + 555055550530.
It is an arithmetic number, because the mean of its divisors is an integer number (555055550530).
Almost surely, 21110111101059 is an apocalyptic number.
1110111101059 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110111101059 is an equidigital number, since it uses as much as digits as its factorization.
1110111101059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45, while the sum is 22.
The spelling of 1110111101059 in words is "one trillion, one hundred ten billion, one hundred eleven million, one hundred one thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •