Base | Representation |
---|---|
bin | 100111011100000… |
… | …0100111100000001 |
3 | 10102020001210002001 |
4 | 1032320010330001 |
5 | 10202232320022 |
6 | 335151224001 |
7 | 44536026643 |
oct | 11670047401 |
9 | 3366053061 |
10 | 1323323137 |
11 | 619a88294 |
12 | 30b218001 |
13 | 181212b56 |
14 | c7a72893 |
15 | 7b29ab27 |
hex | 4ee04f01 |
1323323137 has 2 divisors, whose sum is σ = 1323323138. Its totient is φ = 1323323136.
The previous prime is 1323323021. The next prime is 1323323149. The reversal of 1323323137 is 7313233231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1143521856 + 179801281 = 33816^2 + 13409^2 .
It is an emirp because it is prime and its reverse (7313233231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1323323137 is a prime.
It is not a weakly prime, because it can be changed into another prime (1323383137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661661568 + 661661569.
It is an arithmetic number, because the mean of its divisors is an integer number (661661569).
Almost surely, 21323323137 is an apocalyptic number.
It is an amenable number.
1323323137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323323137 is an equidigital number, since it uses as much as digits as its factorization.
1323323137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6804, while the sum is 28.
The square root of 1323323137 is about 36377.5086695062. The cubic root of 1323323137 is about 1097.8810826828.
Adding to 1323323137 its reverse (7313233231), we get a palindrome (8636556368).
The spelling of 1323323137 in words is "one billion, three hundred twenty-three million, three hundred twenty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •