Base | Representation |
---|---|
bin | 1011000000111001101011… |
… | …0011100000010001010011 |
3 | 1120212201022101110200002102 |
4 | 2300032122303200101103 |
5 | 3041403001130001321 |
6 | 41431150245311015 |
7 | 2356632546405206 |
oct | 260163263402123 |
9 | 46781271420072 |
10 | 12110110000211 |
11 | 3949961426783 |
12 | 143702b40546b |
13 | 69ac94921c72 |
14 | 2dc1bd63793d |
15 | 1600299e5c0b |
hex | b039ace0453 |
12110110000211 has 2 divisors, whose sum is σ = 12110110000212. Its totient is φ = 12110110000210.
The previous prime is 12110110000133. The next prime is 12110110000213. The reversal of 12110110000211 is 11200001101121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12110110000211 - 226 = 12110042891347 is a prime.
Together with 12110110000213, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 12110110000192 and 12110110000201.
It is not a weakly prime, because it can be changed into another prime (12110110000213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055055000105 + 6055055000106.
It is an arithmetic number, because the mean of its divisors is an integer number (6055055000106).
Almost surely, 212110110000211 is an apocalyptic number.
12110110000211 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110110000211 is an equidigital number, since it uses as much as digits as its factorization.
12110110000211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 12110110000211 its reverse (11200001101121), we get a palindrome (23310111101332).
The spelling of 12110110000211 in words is "twelve trillion, one hundred ten billion, one hundred ten million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •