Base | Representation |
---|---|
bin | 1101010110100… |
… | …00010001001000 |
3 | 21210202022000200 |
4 | 12223100101020 |
5 | 212133031440 |
6 | 15040332200 |
7 | 2530000536 |
oct | 653202110 |
9 | 253668020 |
10 | 112002120 |
11 | 5824993a |
12 | 31614060 |
13 | 1a286759 |
14 | 10c37156 |
15 | 9c75c30 |
hex | 6ad0448 |
112002120 has 96 divisors (see below), whose sum is σ = 385440120. Its totient is φ = 28108800.
The previous prime is 112002067. The next prime is 112002151. The reversal of 112002120 is 21200211.
It can be written as a sum of positive squares in 4 ways, for example, as 70862724 + 41139396 = 8418^2 + 6414^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3031 + ... + 15270.
Almost surely, 2112002120 is an apocalyptic number.
112002120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112002120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (192720060).
112002120 is an abundant number, since it is smaller than the sum of its proper divisors (273438000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112002120 is a wasteful number, since it uses less digits than its factorization.
112002120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18335 (or 18328 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 112002120 is about 10583.1054043697. The cubic root of 112002120 is about 482.0314941859.
Adding to 112002120 its reverse (21200211), we get a palindrome (133202331).
The spelling of 112002120 in words is "one hundred twelve million, two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •