Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …101001101100001111000 |
3 | 10221010101121120121010201 |
4 | 100021313311031201320 |
5 | 121142002133000440 |
6 | 2205551200451544 |
7 | 143126416211314 |
oct | 20116765154170 |
9 | 3833347517121 |
10 | 1110112000120 |
11 | 398883313392 |
12 | 15b192319bb4 |
13 | 808b5a4b2b6 |
14 | 3ba30462b44 |
15 | 1dd235d419a |
hex | 10277d4d878 |
1110112000120 has 64 divisors (see below), whose sum is σ = 2583620352000. Its totient is φ = 428838157440.
The previous prime is 1110112000103. The next prime is 1110112000139. The reversal of 1110112000120 is 210002110111.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 1110112000097 and 1110112000106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 315270 + ... + 1523029.
It is an arithmetic number, because the mean of its divisors is an integer number (40369068000).
Almost surely, 21110112000120 is an apocalyptic number.
1110112000120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1110112000120 is an abundant number, since it is smaller than the sum of its proper divisors (1473508351880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110112000120 is a wasteful number, since it uses less digits than its factorization.
1110112000120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1838828 (or 1838824 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1110112000120 its reverse (210002110111), we get a palindrome (1320114110231).
The spelling of 1110112000120 in words is "one trillion, one hundred ten billion, one hundred twelve million, one hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •