Base | Representation |
---|---|
bin | 10000001001110111101… |
… | …101100101001111111000 |
3 | 10221010101110210222122122 |
4 | 100021313231211033320 |
5 | 121142001130000440 |
6 | 2205551045540412 |
7 | 143126363211362 |
oct | 20116755451770 |
9 | 3833343728578 |
10 | 1110110000120 |
11 | 3988821777a0 |
12 | 15b191714708 |
13 | 808b54cab74 |
14 | 3ba300a1d32 |
15 | 1dd2333b7b5 |
hex | 10277b653f8 |
1110110000120 has 64 divisors (see below), whose sum is σ = 2751793935840. Its totient is φ = 399679552000.
The previous prime is 1110110000099. The next prime is 1110110000123. The reversal of 1110110000120 is 210000110111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a junction number, because it is equal to n+sod(n) for n = 1110110000098 and 1110110000107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110110000123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12445547 + ... + 12534426.
Almost surely, 21110110000120 is an apocalyptic number.
1110110000120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1110110000120 is an abundant number, since it is smaller than the sum of its proper divisors (1641683935720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110110000120 is a wasteful number, since it uses less digits than its factorization.
1110110000120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24980096 (or 24980092 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1110110000120 its reverse (210000110111), we get a palindrome (1320110110231).
The spelling of 1110110000120 in words is "one trillion, one hundred ten billion, one hundred ten million, one hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •