Base | Representation |
---|---|
bin | 111000011001011001… |
… | …0100100000101101110 |
3 | 102120121110002102111002 |
4 | 1300302302210011232 |
5 | 3441013431400420 |
6 | 131345425200302 |
7 | 11515151133605 |
oct | 1606262440556 |
9 | 376543072432 |
10 | 121111200110 |
11 | 473aa12a21a |
12 | 1b57ba90092 |
13 | b561489c24 |
14 | 5c0cb5ca3c |
15 | 323c800075 |
hex | 1c32ca416e |
121111200110 has 64 divisors (see below), whose sum is σ = 238925332800. Its totient is φ = 44041190400.
The previous prime is 121111200109. The next prime is 121111200113. The reversal of 121111200110 is 11002111121.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 121111200091 and 121111200100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121111200113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 347756 + ... + 602624.
It is an arithmetic number, because the mean of its divisors is an integer number (3733208325).
Almost surely, 2121111200110 is an apocalyptic number.
121111200110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121111200110 is a deficient number, since it is larger than the sum of its proper divisors (117814132690).
121111200110 is a wasteful number, since it uses less digits than its factorization.
121111200110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254997.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 121111200110 its reverse (11002111121), we get a palindrome (132113311231).
The spelling of 121111200110 in words is "one hundred twenty-one billion, one hundred eleven million, two hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •