Base | Representation |
---|---|
bin | 11001000011101001110010… |
… | …111111110001001110111001 |
3 | 112110012020010210220012202212 |
4 | 121003221302333301032321 |
5 | 103421023101222400441 |
6 | 1030214105235504505 |
7 | 32132563153045301 |
oct | 3103516277611671 |
9 | 473166123805685 |
10 | 110202200200121 |
11 | 321285440582a7 |
12 | 10439b11a58135 |
13 | 496503b3920a3 |
14 | 1d2db5a312601 |
15 | cb192ade2eeb |
hex | 643a72ff13b9 |
110202200200121 has 16 divisors (see below), whose sum is σ = 116864222126400. Its totient is φ = 103560143382528.
The previous prime is 110202200200111. The next prime is 110202200200153. The reversal of 110202200200121 is 121002002202011.
It is a cyclic number.
It is not a de Polignac number, because 110202200200121 - 222 = 110202196005817 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110202200200096 and 110202200200105.
It is not an unprimeable number, because it can be changed into a prime (110202200200111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 225589910 + ... + 226077888.
It is an arithmetic number, because the mean of its divisors is an integer number (7304013882900).
Almost surely, 2110202200200121 is an apocalyptic number.
It is an amenable number.
110202200200121 is a deficient number, since it is larger than the sum of its proper divisors (6662021926279).
110202200200121 is a wasteful number, since it uses less digits than its factorization.
110202200200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508408.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 110202200200121 its reverse (121002002202011), we get a palindrome (231204202402132).
The spelling of 110202200200121 in words is "one hundred ten trillion, two hundred two billion, two hundred million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •