Base | Representation |
---|---|
bin | 11011100010100011110111… |
… | …000001110111110000111110 |
3 | 120212212011121220212001010002 |
4 | 123202203313001313300332 |
5 | 111333431302341210420 |
6 | 1105334440345314302 |
7 | 34340535402450242 |
oct | 3342436701676076 |
9 | 525764556761102 |
10 | 121122222210110 |
11 | 35658711873600 |
12 | 1170236b195992 |
13 | 5277a130b95a4 |
14 | 21ca4bd9dc422 |
15 | e00a00eca075 |
hex | 6e28f7077c3e |
121122222210110 has 192 divisors, whose sum is σ = 246668356214784. Its totient is φ = 42763723200000.
The previous prime is 121122222210079. The next prime is 121122222210167. The reversal of 121122222210110 is 11012222221121.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 13323306665 + ... + 13323315755.
It is an arithmetic number, because the mean of its divisors is an integer number (1284731021952).
Almost surely, 2121122222210110 is an apocalyptic number.
121122222210110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121122222210110 is an abundant number, since it is smaller than the sum of its proper divisors (125546134004674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121122222210110 is a wasteful number, since it uses less digits than its factorization.
121122222210110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10423 (or 10412 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 121122222210110 its reverse (11012222221121), we get a palindrome (132134444431231).
It can be divided in two parts, 12112 and 2222210110, that added together give a palindrome (2222222222).
The spelling of 121122222210110 in words is "one hundred twenty-one trillion, one hundred twenty-two billion, two hundred twenty-two million, two hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •