Base | Representation |
---|---|
bin | 10110101111100101… |
… | …01011101000010101 |
3 | 1011111221212121210222 |
4 | 23113302223220111 |
5 | 200001320300231 |
6 | 5335341324125 |
7 | 611404011146 |
oct | 132762535025 |
9 | 34457777728 |
10 | 12210321941 |
11 | 51a6454664 |
12 | 2449266645 |
13 | 11c78c408c |
14 | 83b929acd |
15 | 4b6e6827b |
hex | 2d7caba15 |
12210321941 has 2 divisors, whose sum is σ = 12210321942. Its totient is φ = 12210321940.
The previous prime is 12210321919. The next prime is 12210321967. The reversal of 12210321941 is 14912301221.
It is an a-pointer prime, because the next prime (12210321967) can be obtained adding 12210321941 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11314576900 + 895745041 = 106370^2 + 29929^2 .
It is a cyclic number.
It is not a de Polignac number, because 12210321941 - 214 = 12210305557 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12210321941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12210321241) 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, 6105160970 + 6105160971.
It is an arithmetic number, because the mean of its divisors is an integer number (6105160971).
Almost surely, 212210321941 is an apocalyptic number.
It is an amenable number.
12210321941 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210321941 is an equidigital number, since it uses as much as digits as its factorization.
12210321941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The spelling of 12210321941 in words is "twelve billion, two hundred ten million, three hundred twenty-one thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •