Base | Representation |
---|---|
bin | 111000110100001101… |
… | …1000100100000100110 |
3 | 102122221011020120010102 |
4 | 1301220123010200212 |
5 | 3444334304323420 |
6 | 132015011224102 |
7 | 11546355324362 |
oct | 1615033044046 |
9 | 378834216112 |
10 | 122011011110 |
11 | 4782104257a |
12 | 1b7912a8032 |
13 | b675a18581 |
14 | 5c9646a2a2 |
15 | 32917e0a75 |
hex | 1c686c4826 |
122011011110 has 32 divisors (see below), whose sum is σ = 232925395392. Its totient is φ = 45917182080.
The previous prime is 122011011103. The next prime is 122011011127. The reversal of 122011011110 is 11110110221.
122011011110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 122011011091 and 122011011100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4334189 + ... + 4362248.
It is an arithmetic number, because the mean of its divisors is an integer number (7278918606).
Almost surely, 2122011011110 is an apocalyptic number.
122011011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122011011110 is a deficient number, since it is larger than the sum of its proper divisors (110914384282).
122011011110 is a wasteful number, since it uses less digits than its factorization.
122011011110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8696528.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 122011011110 its reverse (11110110221), we get a palindrome (133121121331).
The spelling of 122011011110 in words is "one hundred twenty-two billion, eleven million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •