Base | Representation |
---|---|
bin | 11001000010010101111001… |
… | …111011011110100000000000 |
3 | 112102212121122010020210111101 |
4 | 121002111321323132200000 |
5 | 103413034111240431422 |
6 | 1030104451031424144 |
7 | 32123224015514302 |
oct | 3102257173364000 |
9 | 472777563223441 |
10 | 110112122202112 |
11 | 320a331a403148 |
12 | 10424572b25054 |
13 | 49596b4360a54 |
14 | 1d29652d0d972 |
15 | cae407caac27 |
hex | 642579ede800 |
110112122202112 has 48 divisors (see below), whose sum is σ = 223902181994400. Its totient is φ = 54122907463680.
The previous prime is 110112122202109. The next prime is 110112122202119. The reversal of 110112122202112 is 211202221211011.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 110112122202112.
It is not an unprimeable number, because it can be changed into a prime (110112122202119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 455520564 + ... + 455762227.
It is an arithmetic number, because the mean of its divisors is an integer number (4664628791550).
Almost surely, 2110112122202112 is an apocalyptic number.
It is an amenable number.
110112122202112 is an abundant number, since it is smaller than the sum of its proper divisors (113790059792288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110112122202112 is an frugal number, since it uses more digits than its factorization.
110112122202112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 911282872 (or 911282852 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 110112122202112 its reverse (211202221211011), we get a palindrome (321314343413123).
The spelling of 110112122202112 in words is "one hundred ten trillion, one hundred twelve billion, one hundred twenty-two million, two hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •