Base | Representation |
---|---|
bin | 111000010110011010… |
… | …0101110000110011110 |
3 | 102120100110201220211202 |
4 | 1300230310232012132 |
5 | 3440312320231420 |
6 | 131331451515502 |
7 | 11512524252653 |
oct | 1605464560636 |
9 | 376313656752 |
10 | 121011102110 |
11 | 473586810a8 |
12 | 1b552458b92 |
13 | b546810942 |
14 | 5bdd743c2a |
15 | 3233b2b575 |
hex | 1c2cd2e19e |
121011102110 has 16 divisors (see below), whose sum is σ = 217824062976. Its totient is φ = 48403534368.
The previous prime is 121011102103. The next prime is 121011102119. The reversal of 121011102110 is 11201110121.
121011102110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 121011102091 and 121011102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121011102119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 791192 + ... + 931668.
It is an arithmetic number, because the mean of its divisors is an integer number (13614003936).
Almost surely, 2121011102110 is an apocalyptic number.
121011102110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121011102110 is a deficient number, since it is larger than the sum of its proper divisors (96812960866).
121011102110 is a wasteful number, since it uses less digits than its factorization.
121011102110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226627.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 121011102110 its reverse (11201110121), we get a palindrome (132212212231).
The spelling of 121011102110 in words is "one hundred twenty-one billion, eleven million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •