Base | Representation |
---|---|
bin | 110010010001101110111111… |
… | …010100110101111101001101 |
3 | 1001222220221222110110111102222 |
4 | 302101232333110311331031 |
5 | 212440321312332241414 |
6 | 2102141331252225125 |
7 | 64401315535410221 |
oct | 6221567724657515 |
9 | 1058827873414388 |
10 | 221121011212109 |
11 | 64501992241a88 |
12 | 2097289730b1a5 |
13 | 964c81138a168 |
14 | 3c86457a5a781 |
15 | 1a86ce92da68e |
hex | c91bbf535f4d |
221121011212109 has 2 divisors, whose sum is σ = 221121011212110. Its totient is φ = 221121011212108.
The previous prime is 221121011212099. The next prime is 221121011212117. The reversal of 221121011212109 is 901212110121122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 186003499656100 + 35117511556009 = 13638310^2 + 5926003^2 .
It is a cyclic number.
It is not a de Polignac number, because 221121011212109 - 244 = 203528825167693 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 (221121011212159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110560505606054 + 110560505606055.
It is an arithmetic number, because the mean of its divisors is an integer number (110560505606055).
Almost surely, 2221121011212109 is an apocalyptic number.
It is an amenable number.
221121011212109 is a deficient number, since it is larger than the sum of its proper divisors (1).
221121011212109 is an equidigital number, since it uses as much as digits as its factorization.
221121011212109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 26.
The spelling of 221121011212109 in words is "two hundred twenty-one trillion, one hundred twenty-one billion, eleven million, two hundred twelve thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •