Base | Representation |
---|---|
bin | 10000001001110111101… |
… | …101100101101101011011 |
3 | 10221010101110211002020200 |
4 | 100021313231211231123 |
5 | 121142001130031021 |
6 | 2205551045553243 |
7 | 143126363220033 |
oct | 20116755455533 |
9 | 3833343732220 |
10 | 1110110002011 |
11 | 39888217915a |
12 | 15b191715823 |
13 | 808b54cb99a |
14 | 3ba300a28c3 |
15 | 1dd2333c126 |
hex | 10277b65b5b |
1110110002011 has 24 divisors (see below), whose sum is σ = 1635060641760. Its totient is φ = 725618476800.
The previous prime is 1110110001961. The next prime is 1110110002013. The reversal of 1110110002011 is 1102000110111.
It is not a de Polignac number, because 1110110002011 - 218 = 1110109739867 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1110110001984 and 1110110002002.
It is not an unprimeable number, because it can be changed into a prime (1110110002013) 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 23 ways as a sum of consecutive naturals, for example, 4683406 + ... + 4914723.
It is an arithmetic number, because the mean of its divisors is an integer number (68127526740).
Almost surely, 21110110002011 is an apocalyptic number.
1110110002011 is a deficient number, since it is larger than the sum of its proper divisors (524950639749).
1110110002011 is a wasteful number, since it uses less digits than its factorization.
1110110002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9598387 (or 9598384 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1110110002011 its reverse (1102000110111), we get a palindrome (2212110112122).
The spelling of 1110110002011 in words is "one trillion, one hundred ten billion, one hundred ten million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •