Base | Representation |
---|---|
bin | 11011101111010101011101… |
… | …010110000111000100101110 |
3 | 120222222002121120121011210012 |
4 | 123233111131112013010232 |
5 | 111442322212200320420 |
6 | 1111250024445013222 |
7 | 34461134336534060 |
oct | 3357253526070456 |
9 | 528862546534705 |
10 | 122000112120110 |
11 | 35966a58834544 |
12 | 11824532854212 |
13 | 530c73ac893b3 |
14 | 221aba0787730 |
15 | e187823cddc5 |
hex | 6ef55d58712e |
122000112120110 has 128 divisors (see below), whose sum is σ = 257058855465984. Its totient is φ = 40815999866880.
The previous prime is 122000112120071. The next prime is 122000112120121. The reversal of 122000112120110 is 11021211000221.
It is a super-3 number, since 3×1220001121201103 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent 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, 17322176249 + ... + 17322183291.
It is an arithmetic number, because the mean of its divisors is an integer number (2008272308328).
Almost surely, 2122000112120110 is an apocalyptic number.
122000112120110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122000112120110 is an abundant number, since it is smaller than the sum of its proper divisors (135058743345874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122000112120110 is a wasteful number, since it uses less digits than its factorization.
122000112120110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11898.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 122000112120110 its reverse (11021211000221), we get a palindrome (133021323120331).
The spelling of 122000112120110 in words is "one hundred twenty-two trillion, one hundred twelve million, one hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •