Base | Representation |
---|---|
bin | 10011010000001000111… |
… | …101010101000100110001 |
3 | 11200110220011022210100021 |
4 | 103100020331111010301 |
5 | 133134001024101001 |
6 | 2451440010123441 |
7 | 164404115224243 |
oct | 23201075250461 |
9 | 4613804283307 |
10 | 1323000222001 |
11 | 470099153427 |
12 | 1944a6120581 |
13 | 979b2233663 |
14 | 480680d4093 |
15 | 2463327aba1 |
hex | 13408f55131 |
1323000222001 has 2 divisors, whose sum is σ = 1323000222002. Its totient is φ = 1323000222000.
The previous prime is 1323000221941. The next prime is 1323000222031. The reversal of 1323000222001 is 1002220003231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1163259317025 + 159740904976 = 1078545^2 + 399676^2 .
It is an emirp because it is prime and its reverse (1002220003231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1323000222001 - 29 = 1323000221489 is a prime.
It is not a weakly prime, because it can be changed into another prime (1323000222031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661500111000 + 661500111001.
It is an arithmetic number, because the mean of its divisors is an integer number (661500111001).
Almost surely, 21323000222001 is an apocalyptic number.
It is an amenable number.
1323000222001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323000222001 is an equidigital number, since it uses as much as digits as its factorization.
1323000222001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 1323000222001 its reverse (1002220003231), we get a palindrome (2325220225232).
The spelling of 1323000222001 in words is "one trillion, three hundred twenty-three billion, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •