Base | Representation |
---|---|
bin | 1011001101001111001001… |
… | …1001100110011011101101 |
3 | 1121121222022122222121112212 |
4 | 2303103302121212123231 |
5 | 3103341010422032341 |
6 | 42112355214540205 |
7 | 2411144315245055 |
oct | 263236231463355 |
9 | 47558278877485 |
10 | 12322033002221 |
11 | 3a20821438848 |
12 | 1470113b07665 |
13 | 6b4c69156ac7 |
14 | 308565012565 |
15 | 1657cea7b5eb |
hex | b34f26666ed |
12322033002221 has 2 divisors, whose sum is σ = 12322033002222. Its totient is φ = 12322033002220.
The previous prime is 12322033002217. The next prime is 12322033002239. The reversal of 12322033002221 is 12220033022321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9884956081225 + 2437076920996 = 3144035^2 + 1561114^2 .
It is an emirp because it is prime and its reverse (12220033022321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12322033002221 - 22 = 12322033002217 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12322033002271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6161016501110 + 6161016501111.
It is an arithmetic number, because the mean of its divisors is an integer number (6161016501111).
Almost surely, 212322033002221 is an apocalyptic number.
It is an amenable number.
12322033002221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12322033002221 is an equidigital number, since it uses as much as digits as its factorization.
12322033002221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 12322033002221 its reverse (12220033022321), we get a palindrome (24542066024542).
The spelling of 12322033002221 in words is "twelve trillion, three hundred twenty-two billion, thirty-three million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •