Base | Representation |
---|---|
bin | 110000000001010111010101… |
… | …101100101111000000100101 |
3 | 1000200210112010222101012000212 |
4 | 300001113111230233000211 |
5 | 210140300111100320401 |
6 | 2025103540210545205 |
7 | 62325461120464544 |
oct | 6001272554570045 |
9 | 1020715128335025 |
10 | 211200012120101 |
11 | 61327470961474 |
12 | 1b82bb88898205 |
13 | 90b00ca386954 |
14 | 3a221c6b1415b |
15 | 1963be4cb3dbb |
hex | c015d5b2f025 |
211200012120101 has 2 divisors, whose sum is σ = 211200012120102. Its totient is φ = 211200012120100.
The previous prime is 211200012120091. The next prime is 211200012120107. The reversal of 211200012120101 is 101021210002112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 175711196472100 + 35488815648001 = 13255610^2 + 5957249^2 .
It is a cyclic number.
It is not a de Polignac number, because 211200012120101 - 26 = 211200012120037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211200012120107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105600006060050 + 105600006060051.
It is an arithmetic number, because the mean of its divisors is an integer number (105600006060051).
Almost surely, 2211200012120101 is an apocalyptic number.
It is an amenable number.
211200012120101 is a deficient number, since it is larger than the sum of its proper divisors (1).
211200012120101 is an equidigital number, since it uses as much as digits as its factorization.
211200012120101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 211200012120101 its reverse (101021210002112), we get a palindrome (312221222122213).
The spelling of 211200012120101 in words is "two hundred eleven trillion, two hundred billion, twelve million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •