Base | Representation |
---|---|
bin | 11001000010010101111001… |
… | …110111101111001101110010 |
3 | 112102212121122001102000001000 |
4 | 121002111321313233031302 |
5 | 103413034111013101002 |
6 | 1030104450554422430 |
7 | 32123224004262654 |
oct | 3102257167571562 |
9 | 472777561360030 |
10 | 110112121222002 |
11 | 320a33198a3839 |
12 | 10424572731a16 |
13 | 49596b40a98c3 |
14 | 1d29652b366d4 |
15 | cae407b6561c |
hex | 642579def372 |
110112121222002 has 64 divisors (see below), whose sum is σ = 259212801110400. Its totient is φ = 34550769464640.
The previous prime is 110112121222001. The next prime is 110112121222007. The reversal of 110112121222002 is 200222121211011.
110112121222002 is a `hidden beast` number, since 110 + 1 + 121 + 212 + 220 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (110112121222001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 341627949 + ... + 341950112.
It is an arithmetic number, because the mean of its divisors is an integer number (4050200017350).
Almost surely, 2110112121222002 is an apocalyptic number.
110112121222002 is an abundant number, since it is smaller than the sum of its proper divisors (149100679888398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110112121222002 is a wasteful number, since it uses less digits than its factorization.
110112121222002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683578248 (or 683578242 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 110112121222002 its reverse (200222121211011), we get a palindrome (310334242433013).
The spelling of 110112121222002 in words is "one hundred ten trillion, one hundred twelve billion, one hundred twenty-one million, two hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •