Base | Representation |
---|---|
bin | 111000110100001111… |
… | …1101001101110001110 |
3 | 102122221020111120120220 |
4 | 1301220133221232032 |
5 | 3444340111241420 |
6 | 132015053052210 |
7 | 11546401456005 |
oct | 1615037515616 |
9 | 378836446526 |
10 | 122012212110 |
11 | 47821792938 |
12 | 1b791787066 |
13 | b676049119 |
14 | 5c9669dc3c |
15 | 329197b840 |
hex | 1c687e9b8e |
122012212110 has 64 divisors (see below), whose sum is σ = 302337792000. Its totient is φ = 31480525440.
The previous prime is 122012212013. The next prime is 122012212123. The reversal of 122012212110 is 11212210221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 122012212110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5870016 + ... + 5890764.
It is an arithmetic number, because the mean of its divisors is an integer number (4724028000).
Almost surely, 2122012212110 is an apocalyptic number.
122012212110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122012212110 is an abundant number, since it is smaller than the sum of its proper divisors (180325579890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122012212110 is a wasteful number, since it uses less digits than its factorization.
122012212110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27113.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122012212110 its reverse (11212210221), we get a palindrome (133224422331).
The spelling of 122012212110 in words is "one hundred twenty-two billion, twelve million, two hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •