Base | Representation |
---|---|
bin | 110100001101001000… |
… | …1110000011100110010 |
3 | 101201101010202200222110 |
4 | 1220122101300130302 |
5 | 3314100130342320 |
6 | 123300322350150 |
7 | 11046122244360 |
oct | 1503221603462 |
9 | 351333680873 |
10 | 112110012210 |
11 | 436001a7559 |
12 | 198894bb356 |
13 | a7586b2041 |
14 | 55d7518630 |
15 | 2db248b5e0 |
hex | 1a1a470732 |
112110012210 has 128 divisors (see below), whose sum is σ = 326703352320. Its totient is φ = 24072781824.
The previous prime is 112110012193. The next prime is 112110012347. The reversal of 112110012210 is 12210011211.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 23439 + ... + 474098.
It is an arithmetic number, because the mean of its divisors is an integer number (2552369940).
Almost surely, 2112110012210 is an apocalyptic number.
112110012210 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 112110012210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163351676160).
112110012210 is an abundant number, since it is smaller than the sum of its proper divisors (214593340110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110012210 is a wasteful number, since it uses less digits than its factorization.
112110012210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 497620.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112110012210 its reverse (12210011211), we get a palindrome (124320023421).
Subtracting from 112110012210 its reverse (12210011211), we obtain a palindrome (99900000999).
The spelling of 112110012210 in words is "one hundred twelve billion, one hundred ten million, twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •