Base | Representation |
---|---|
bin | 11110110111010101011… |
… | …101010000100000011111 |
3 | 21111202200010212111010221 |
4 | 132313111131100200133 |
5 | 234222302010444402 |
6 | 4302212440542211 |
7 | 306144234221434 |
oct | 36672535204037 |
9 | 7452603774127 |
10 | 2121000093727 |
11 | 748569293149 |
12 | 2a3092781967 |
13 | 1250179bc478 |
14 | 7492a969b8b |
15 | 3a28ab82337 |
hex | 1edd575081f |
2121000093727 has 2 divisors, whose sum is σ = 2121000093728. Its totient is φ = 2121000093726.
The previous prime is 2121000093721. The next prime is 2121000093761. The reversal of 2121000093727 is 7273900001212.
It is an a-pointer prime, because the next prime (2121000093761) can be obtained adding 2121000093727 to its sum of digits (34).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2121000093727 - 27 = 2121000093599 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2121000093692 and 2121000093701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2121000093721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060500046863 + 1060500046864.
It is an arithmetic number, because the mean of its divisors is an integer number (1060500046864).
Almost surely, 22121000093727 is an apocalyptic number.
2121000093727 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121000093727 is an equidigital number, since it uses as much as digits as its factorization.
2121000093727 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10584, while the sum is 34.
Adding to 2121000093727 its reverse (7273900001212), we get a palindrome (9394900094939).
The spelling of 2121000093727 in words is "two trillion, one hundred twenty-one billion, ninety-three thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •