Base | Representation |
---|---|
bin | 11001011111011010101011… |
… | …010010000110101010011010 |
3 | 112200221121210022210200211001 |
4 | 121133122223102012222122 |
5 | 104143303001130310020 |
6 | 1034234401252255214 |
7 | 32420455015621150 |
oct | 3137325322065232 |
9 | 480847708720731 |
10 | 112110110010010 |
11 | 327a36a343a252 |
12 | 106a783501150a |
13 | 4a72c26a6c4b8 |
14 | 1d9823044d3d0 |
15 | ce63942b850a |
hex | 65f6ab486a9a |
112110110010010 has 192 divisors, whose sum is σ = 261734135961600. Its totient is φ = 33761130365952.
The previous prime is 112110110009981. The next prime is 112110110010053. The reversal of 112110110010010 is 10010011011211.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 23576131 + ... + 27929449.
It is an arithmetic number, because the mean of its divisors is an integer number (1363198624800).
Almost surely, 2112110110010010 is an apocalyptic number.
112110110010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112110110010010 is an abundant number, since it is smaller than the sum of its proper divisors (149624025951590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110110010010 is a wasteful number, since it uses less digits than its factorization.
112110110010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4353453 (or 4353436 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 112110110010010 its reverse (10010011011211), we get a palindrome (122120121021221).
The spelling of 112110110010010 in words is "one hundred twelve trillion, one hundred ten billion, one hundred ten million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •