Base | Representation |
---|---|
bin | 11001000010010100000010… |
… | …101101110001101111100100 |
3 | 112102212102110201202012200001 |
4 | 121002110002231301233210 |
5 | 103413021012230402322 |
6 | 1030103520343031044 |
7 | 32123123321230462 |
oct | 3102240255615744 |
9 | 472772421665601 |
10 | 110110122122212 |
11 | 320a2493411553 |
12 | 104240b513b484 |
13 | 4959455b89214 |
14 | 1d29503433832 |
15 | cae33c3ce827 |
hex | 642502b71be4 |
110110122122212 has 24 divisors (see below), whose sum is σ = 197504044670016. Its totient is φ = 53692835490528.
The previous prime is 110110122122173. The next prime is 110110122122279. The reversal of 110110122122212 is 212221221011011.
It is a happy number.
110110122122212 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 110110122122212.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1555016598 + ... + 1555087405.
It is an arithmetic number, because the mean of its divisors is an integer number (8229335194584).
Almost surely, 2110110122122212 is an apocalyptic number.
It is an amenable number.
110110122122212 is a deficient number, since it is larger than the sum of its proper divisors (87393922547804).
110110122122212 is a wasteful number, since it uses less digits than its factorization.
110110122122212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3110104227 (or 3110104225 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 110110122122212 its reverse (212221221011011), we get a palindrome (322331343133223).
The spelling of 110110122122212 in words is "one hundred ten trillion, one hundred ten billion, one hundred twenty-two million, one hundred twenty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •