Base | Representation |
---|---|
bin | 111000011100010101… |
… | …1011111100111111111 |
3 | 102120212100000111022202 |
4 | 1300320223133213333 |
5 | 3441214230310421 |
6 | 131403315102115 |
7 | 11520461041451 |
oct | 1607053374777 |
9 | 376770014282 |
10 | 121210010111 |
11 | 4744a988683 |
12 | 1b5a8ba193b |
13 | b578aa4b98 |
14 | 5c1bd202d1 |
15 | 324631c10b |
hex | 1c38adf9ff |
121210010111 has 4 divisors (see below), whose sum is σ = 122917193424. Its totient is φ = 119502826800.
The previous prime is 121210010099. The next prime is 121210010147. The reversal of 121210010111 is 111010012121.
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 121210010111 - 210 = 121210009087 is a prime.
It is a super-2 number, since 2×1212100101112 (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 = 121210010092 and 121210010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121210012111) 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, 853591550 + ... + 853591691.
It is an arithmetic number, because the mean of its divisors is an integer number (30729298356).
Almost surely, 2121210010111 is an apocalyptic number.
121210010111 is a deficient number, since it is larger than the sum of its proper divisors (1707183313).
121210010111 is an equidigital number, since it uses as much as digits as its factorization.
121210010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1707183312.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 121210010111 its reverse (111010012121), we get a palindrome (232220022232).
The spelling of 121210010111 in words is "one hundred twenty-one billion, two hundred ten million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •