Base | Representation |
---|---|
bin | 110100001100110101… |
… | …1111110111100101010 |
3 | 101201100110010121212110 |
4 | 1220121223332330222 |
5 | 3314040112010442 |
6 | 123255330223150 |
7 | 11045642133330 |
oct | 1503153767452 |
9 | 351313117773 |
10 | 112100110122 |
11 | 435a5653a10 |
12 | 19886124ab6 |
13 | a756625c10 |
14 | 55d609bb50 |
15 | 2db168269c |
hex | 1a19afef2a |
112100110122 has 256 divisors, whose sum is σ = 315767144448. Its totient is φ = 25591956480.
The previous prime is 112100110117. The next prime is 112100110139. The reversal of 112100110122 is 221011001211.
It is a junction number, because it is equal to n+sod(n) for n = 112100110098 and 112100110107.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 10439068 + ... + 10449800.
It is an arithmetic number, because the mean of its divisors is an integer number (1233465408).
Almost surely, 2112100110122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112100110122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157883572224).
112100110122 is an abundant number, since it is smaller than the sum of its proper divisors (203667034326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112100110122 is a wasteful number, since it uses less digits than its factorization.
112100110122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10853.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112100110122 its reverse (221011001211), we get a palindrome (333111111333).
It can be divided in two parts, 112100 and 110122, that added together give a palindrome (222222).
The spelling of 112100110122 in words is "one hundred twelve billion, one hundred million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •