Base | Representation |
---|---|
bin | 10110110000111001… |
… | …01001101110111101 |
3 | 1011112201120121002211 |
4 | 23120130221232331 |
5 | 200012124333341 |
6 | 5340413220421 |
7 | 611566353601 |
oct | 133034515675 |
9 | 34481517084 |
10 | 12221324221 |
11 | 5201689857 |
12 | 2450a91711 |
13 | 11c9c76bc2 |
14 | 83d191501 |
15 | 4b7ddd181 |
hex | 2d8729bbd |
12221324221 has 2 divisors, whose sum is σ = 12221324222. Its totient is φ = 12221324220.
The previous prime is 12221324207. The next prime is 12221324243. The reversal of 12221324221 is 12242312221.
It is an a-pointer prime, because the next prime (12221324243) can be obtained adding 12221324221 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6482504196 + 5738820025 = 80514^2 + 75755^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12221324221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12221324192 and 12221324201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12221324261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110662110 + 6110662111.
It is an arithmetic number, because the mean of its divisors is an integer number (6110662111).
Almost surely, 212221324221 is an apocalyptic number.
It is an amenable number.
12221324221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12221324221 is an equidigital number, since it uses as much as digits as its factorization.
12221324221 is an evil number, because the sum of its binary digits is even.
The product of its digits is 768, while the sum is 22.
Adding to 12221324221 its reverse (12242312221), we get a palindrome (24463636442).
The spelling of 12221324221 in words is "twelve billion, two hundred twenty-one million, three hundred twenty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •