Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …001110100001110000011 |
3 | 10221010101112220101011000 |
4 | 100021313301310032003 |
5 | 121142001421010034 |
6 | 2205551125423043 |
7 | 143126405513262 |
oct | 20116761641603 |
9 | 3833345811130 |
10 | 1110111110019 |
11 | 39888286566a |
12 | 15b191b6aa83 |
13 | 808b57c9102 |
14 | 3ba302b05d9 |
15 | 1dd234aa599 |
hex | 10277c74383 |
1110111110019 has 8 divisors (see below), whose sum is σ = 1644609051920. Its totient is φ = 740074073328.
The previous prime is 1110111109949. The next prime is 1110111110077. The reversal of 1110111110019 is 9100111110111.
It is not a de Polignac number, because 1110111110019 - 233 = 1101521175427 is a prime.
It is a super-2 number, since 2×11101111100192 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110111109983 and 1110111110010.
It is not an unprimeable number, because it can be changed into a prime (1110111110099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20557613122 + ... + 20557613175.
It is an arithmetic number, because the mean of its divisors is an integer number (205576131490).
Almost surely, 21110111110019 is an apocalyptic number.
1110111110019 is a deficient number, since it is larger than the sum of its proper divisors (534497941901).
1110111110019 is an equidigital number, since it uses as much as digits as its factorization.
1110111110019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41115226306 (or 41115226300 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 18.
The spelling of 1110111110019 in words is "one trillion, one hundred ten billion, one hundred eleven million, one hundred ten thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •