Base | Representation |
---|---|
bin | 111000011001000100… |
… | …0101001011110001111 |
3 | 102120120200102011210011 |
4 | 1300302020221132033 |
5 | 3441003123241421 |
6 | 131344353454051 |
7 | 11514655550614 |
oct | 1606210513617 |
9 | 376520364704 |
10 | 121100212111 |
11 | 473a3a0482a |
12 | 1b578271327 |
13 | b55c110758 |
14 | 5c0b4dc50b |
15 | 323b87e4e1 |
hex | 1c3222978f |
121100212111 has 4 divisors (see below), whose sum is σ = 121257690400. Its totient is φ = 120942733824.
The previous prime is 121100212091. The next prime is 121100212117. The reversal of 121100212111 is 111212001121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121100212111 - 29 = 121100211599 is a prime.
It is a super-2 number, since 2×1211002121112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121100212091 and 121100212100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121100212117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78737991 + ... + 78739528.
It is an arithmetic number, because the mean of its divisors is an integer number (30314422600).
Almost surely, 2121100212111 is an apocalyptic number.
121100212111 is a deficient number, since it is larger than the sum of its proper divisors (157478289).
121100212111 is an equidigital number, since it uses as much as digits as its factorization.
121100212111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157478288.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 121100212111 its reverse (111212001121), we get a palindrome (232312213232).
The spelling of 121100212111 in words is "one hundred twenty-one billion, one hundred million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •