Base | Representation |
---|---|
bin | 111000111101110000… |
… | …0111111101000100110 |
3 | 102200202110222111120010 |
4 | 1301323200333220212 |
5 | 4001013310043420 |
6 | 132110452551050 |
7 | 11560325105052 |
oct | 1617340775046 |
9 | 380673874503 |
10 | 122331331110 |
11 | 4797593574a |
12 | 1b860622486 |
13 | b6c71ac331 |
14 | 5cc6c0cc62 |
15 | 32ae9b54e0 |
hex | 1c7b83fa26 |
122331331110 has 64 divisors (see below), whose sum is σ = 296399093760. Its totient is φ = 32310368640.
The previous prime is 122331331091. The next prime is 122331331151. The reversal of 122331331110 is 11133133221.
It is a happy number.
122331331110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1223313311102 (a number of 23 digits) contains 22 as substring.
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, 11868219 + ... + 11878521.
It is an arithmetic number, because the mean of its divisors is an integer number (4631235840).
Almost surely, 2122331331110 is an apocalyptic number.
122331331110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122331331110 is an abundant number, since it is smaller than the sum of its proper divisors (174067762650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122331331110 is a wasteful number, since it uses less digits than its factorization.
122331331110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14053.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 122331331110 its reverse (11133133221), we get a palindrome (133464464331).
The spelling of 122331331110 in words is "one hundred twenty-two billion, three hundred thirty-one million, three hundred thirty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •