Base | Representation |
---|---|
bin | 1100111000011100111… |
… | …0110001110010100001 |
3 | 210011020121211002000022 |
4 | 3032013032301302201 |
5 | 12111221401131314 |
6 | 245400331003225 |
7 | 21663215032262 |
oct | 3160716616241 |
9 | 704217732008 |
10 | 221312130209 |
11 | 85948a23055 |
12 | 36a84b99515 |
13 | 17b3c7bb101 |
14 | a9d6764969 |
15 | 5b544c978e |
hex | 33873b1ca1 |
221312130209 has 2 divisors, whose sum is σ = 221312130210. Its totient is φ = 221312130208.
The previous prime is 221312130199. The next prime is 221312130211. The reversal of 221312130209 is 902031213122.
221312130209 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., 197704729600 + 23607400609 = 444640^2 + 153647^2 .
It is a cyclic number.
It is not a de Polignac number, because 221312130209 - 220 = 221311081633 is a prime.
Together with 221312130211, 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 (221312130239) 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, 110656065104 + 110656065105.
It is an arithmetic number, because the mean of its divisors is an integer number (110656065105).
Almost surely, 2221312130209 is an apocalyptic number.
It is an amenable number.
221312130209 is a deficient number, since it is larger than the sum of its proper divisors (1).
221312130209 is an equidigital number, since it uses as much as digits as its factorization.
221312130209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The spelling of 221312130209 in words is "two hundred twenty-one billion, three hundred twelve million, one hundred thirty thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •