Base | Representation |
---|---|
bin | 10110110000110111… |
… | …00010011011110101 |
3 | 1011112201000202111112 |
4 | 23120123202123311 |
5 | 200012041012211 |
6 | 5340403044405 |
7 | 611564026301 |
oct | 133033423365 |
9 | 34481022445 |
10 | 12221032181 |
11 | 52014aa3a6 |
12 | 2450970705 |
13 | 11c9ba3cb7 |
14 | 83d116d01 |
15 | 4b7d8188b |
hex | 2d86e26f5 |
12221032181 has 2 divisors, whose sum is σ = 12221032182. Its totient is φ = 12221032180.
The previous prime is 12221032171. The next prime is 12221032183. The reversal of 12221032181 is 18123012221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10117342225 + 2103689956 = 100585^2 + 45866^2 .
It is a cyclic number.
It is not a de Polignac number, because 12221032181 - 226 = 12153923317 is a prime.
It is a super-2 number, since 2×122210321812 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 12221032183, it forms a pair of twin primes.
It is a Chen 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 (12221032183) 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, 6110516090 + 6110516091.
It is an arithmetic number, because the mean of its divisors is an integer number (6110516091).
Almost surely, 212221032181 is an apocalyptic number.
It is an amenable number.
12221032181 is a deficient number, since it is larger than the sum of its proper divisors (1).
12221032181 is an equidigital number, since it uses as much as digits as its factorization.
12221032181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
The spelling of 12221032181 in words is "twelve billion, two hundred twenty-one million, thirty-two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •