Base | Representation |
---|---|
bin | 110100001101110010… |
… | …1101011101111010010 |
3 | 101201102200011110101220 |
4 | 1220123211223233102 |
5 | 3314121243404020 |
6 | 123302430105510 |
7 | 11046510245553 |
oct | 1503345535722 |
9 | 351380143356 |
10 | 112132013010 |
11 | 43611664036 |
12 | 1989494b296 |
13 | a760116074 |
14 | 55da40432a |
15 | 2db4385240 |
hex | 1a1b96bbd2 |
112132013010 has 64 divisors (see below), whose sum is σ = 278013579264. Its totient is φ = 28914840000.
The previous prime is 112132012991. The next prime is 112132013069. The reversal of 112132013010 is 10310231211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1169385 + ... + 1261635.
It is an arithmetic number, because the mean of its divisors is an integer number (4343962176).
Almost surely, 2112132013010 is an apocalyptic number.
112132013010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 112132013010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139006789632).
112132013010 is an abundant number, since it is smaller than the sum of its proper divisors (165881566254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112132013010 is a wasteful number, since it uses less digits than its factorization.
112132013010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93599.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 112132013010 its reverse (10310231211), we get a palindrome (122442244221).
The spelling of 112132013010 in words is "one hundred twelve billion, one hundred thirty-two million, thirteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •