Base | Representation |
---|---|
bin | 1011000110110101101010… |
… | …0010011111000010101001 |
3 | 1121020110121000100221111012 |
4 | 2301231122202133002221 |
5 | 3100040400404341014 |
6 | 41550055533113305 |
7 | 2400203331611306 |
oct | 261553242370251 |
9 | 47213530327435 |
10 | 12212111012009 |
11 | 398914432a637 |
12 | 1452957328835 |
13 | 6a779bb7144c |
14 | 3030d83380ad |
15 | 1629e9742c3e |
hex | b1b5a89f0a9 |
12212111012009 has 2 divisors, whose sum is σ = 12212111012010. Its totient is φ = 12212111012008.
The previous prime is 12212111011963. The next prime is 12212111012011. The reversal of 12212111012009 is 90021011121221.
It is a happy number.
12212111012009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10734816618409 + 1477294393600 = 3276403^2 + 1215440^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12212111012009 is a prime.
Together with 12212111012011, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12212111012039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106055506004 + 6106055506005.
It is an arithmetic number, because the mean of its divisors is an integer number (6106055506005).
Almost surely, 212212111012009 is an apocalyptic number.
It is an amenable number.
12212111012009 is a deficient number, since it is larger than the sum of its proper divisors (1).
12212111012009 is an equidigital number, since it uses as much as digits as its factorization.
12212111012009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 12212111012009 in words is "twelve trillion, two hundred twelve billion, one hundred eleven million, twelve thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •