Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …001110100011110111011 |
3 | 10221010101112220102122000 |
4 | 100021313301310132323 |
5 | 121142001421023344 |
6 | 2205551125432043 |
7 | 143126405516364 |
oct | 20116761643673 |
9 | 3833345812560 |
10 | 1110111111099 |
11 | 398882866461 |
12 | 15b191b6b623 |
13 | 808b57c9753 |
14 | 3ba302b0b6b |
15 | 1dd234aaa69 |
hex | 10277c747bb |
1110111111099 has 64 divisors (see below), whose sum is σ = 1698520320000. Its totient is φ = 716257631232.
The previous prime is 1110111111059. The next prime is 1110111111143. The reversal of 1110111111099 is 9901111110111.
It is not a de Polignac number, because 1110111111099 - 215 = 1110111078331 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1110111111059) 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 in 63 ways as a sum of consecutive naturals, for example, 44411497 + ... + 44436485.
It is an arithmetic number, because the mean of its divisors is an integer number (26539380000).
Almost surely, 21110111111099 is an apocalyptic number.
1110111111099 is a deficient number, since it is larger than the sum of its proper divisors (588409208901).
1110111111099 is a wasteful number, since it uses less digits than its factorization.
1110111111099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25489 (or 25483 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 27.
The spelling of 1110111111099 in words is "one trillion, one hundred ten billion, one hundred eleven million, one hundred eleven thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •