Base | Representation |
---|---|
bin | 11011100011110110100011… |
… | …110110110010111101000110 |
3 | 120220011122211110122121011021 |
4 | 123203312203312302331012 |
5 | 111341410132401023420 |
6 | 1105443324022101354 |
7 | 34350131045610400 |
oct | 3343664366627506 |
9 | 526148743577137 |
10 | 121211021111110 |
11 | 3569233a4a8197 |
12 | 1171761187a85a |
13 | 52831c51210a8 |
14 | 21d09051a1b70 |
15 | e02e9bba07aa |
hex | 6e3da3db2f46 |
121211021111110 has 48 divisors (see below), whose sum is σ = 253964885943600. Its totient is φ = 41531235157440.
The previous prime is 121211021111101. The next prime is 121211021111143. The reversal of 121211021111110 is 11111120112121.
It is a super-2 number, since 2×1212110211111102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 79089096 + ... + 80607115.
It is an arithmetic number, because the mean of its divisors is an integer number (5290935123825).
Almost surely, 2121211021111110 is an apocalyptic number.
121211021111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121211021111110 is an abundant number, since it is smaller than the sum of its proper divisors (132753864832490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121211021111110 is a wasteful number, since it uses less digits than its factorization.
121211021111110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159697781 (or 159697774 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 121211021111110 its reverse (11111120112121), we get a palindrome (132322141223231).
The spelling of 121211021111110 in words is "one hundred twenty-one trillion, two hundred eleven billion, twenty-one million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •