Base | Representation |
---|---|
bin | 110100001100110111… |
… | …1110000101001011010 |
3 | 101201100111222220220010 |
4 | 1220121233300221122 |
5 | 3314040340200442 |
6 | 123255403342350 |
7 | 11045653425534 |
oct | 1503157605132 |
9 | 351314886803 |
10 | 112101100122 |
11 | 435a616a7a0 |
12 | 198865219b6 |
13 | a7568b170b |
14 | 55d6278854 |
15 | 2db17cab9c |
hex | 1a19bf0a5a |
112101100122 has 32 divisors (see below), whose sum is σ = 246142102464. Its totient is φ = 33753657600.
The previous prime is 112101100087. The next prime is 112101100127. The reversal of 112101100122 is 221001101211.
112101100122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 112101100098 and 112101100107.
It is not an unprimeable number, because it can be changed into a prime (112101100127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5398879 + ... + 5419602.
It is an arithmetic number, because the mean of its divisors is an integer number (7691940702).
Almost surely, 2112101100122 is an apocalyptic number.
112101100122 is an abundant number, since it is smaller than the sum of its proper divisors (134041002342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112101100122 is a wasteful number, since it uses less digits than its factorization.
112101100122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10818654.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112101100122 its reverse (221001101211), we get a palindrome (333102201333).
The spelling of 112101100122 in words is "one hundred twelve billion, one hundred one million, one hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •