Base | Representation |
---|---|
bin | 11001000001000001001001… |
… | …010011000111011001001001 |
3 | 112102112220201110111121111120 |
4 | 121001001021103013121021 |
5 | 103410041214133031441 |
6 | 1025555000123145453 |
7 | 32113522501545255 |
oct | 3101011123073111 |
9 | 472486643447446 |
10 | 110021112002121 |
11 | 32068767531931 |
12 | 1040a9b3975289 |
13 | 4950c3c16c9c8 |
14 | 1d2509bbab265 |
15 | cabd7cdd5966 |
hex | 6410494c7649 |
110021112002121 has 48 divisors (see below), whose sum is σ = 154044148362624. Its totient is φ = 69832083460608.
The previous prime is 110021112002093. The next prime is 110021112002159. The reversal of 110021112002121 is 121200211120011.
It is a happy number.
It is not a de Polignac number, because 110021112002121 - 27 = 110021112001993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110021112002121.
It is not an unprimeable number, because it can be changed into a prime (110021112072121) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 831870420 + ... + 832002666.
It is an arithmetic number, because the mean of its divisors is an integer number (3209253090888).
Almost surely, 2110021112002121 is an apocalyptic number.
It is an amenable number.
110021112002121 is a deficient number, since it is larger than the sum of its proper divisors (44023036360503).
110021112002121 is a wasteful number, since it uses less digits than its factorization.
110021112002121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136898 (or 136869 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110021112002121 its reverse (121200211120011), we get a palindrome (231221323122132).
The spelling of 110021112002121 in words is "one hundred ten trillion, twenty-one billion, one hundred twelve million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •