Base | Representation |
---|---|
bin | 11110110111011100100… |
… | …110101010110001010111 |
3 | 21111202222111111102011011 |
4 | 132313130212222301113 |
5 | 234223023210013421 |
6 | 4302232402553051 |
7 | 306150221345566 |
oct | 36673446526127 |
9 | 7452874442134 |
10 | 2121120001111 |
11 | 74861aa41361 |
12 | 2a3106968787 |
13 | 1250367b3197 |
14 | 7493c85dbdd |
15 | 3a29646a4e1 |
hex | 1eddc9aac57 |
2121120001111 has 2 divisors, whose sum is σ = 2121120001112. Its totient is φ = 2121120001110.
The previous prime is 2121120001109. The next prime is 2121120001151. The reversal of 2121120001111 is 1111000211212.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2121120001111 - 21 = 2121120001109 is a prime.
It is a super-2 number, since 2×21211200011112 (a number of 25 digits) contains 22 as substring.
Together with 2121120001109, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2121120001091 and 2121120001100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2121120001151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060560000555 + 1060560000556.
It is an arithmetic number, because the mean of its divisors is an integer number (1060560000556).
Almost surely, 22121120001111 is an apocalyptic number.
2121120001111 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121120001111 is an equidigital number, since it uses as much as digits as its factorization.
2121120001111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2121120001111 its reverse (1111000211212), we get a palindrome (3232120212323).
The spelling of 2121120001111 in words is "two trillion, one hundred twenty-one billion, one hundred twenty million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •