Base | Representation |
---|---|
bin | 1000101001011100… |
… | …1000100100011001 |
3 | 12222202222021200212 |
4 | 2022113020210121 |
5 | 14223224221332 |
6 | 1022201540505 |
7 | 111344616266 |
oct | 21227104431 |
9 | 5882867625 |
10 | 2321320217 |
11 | a91363267 |
12 | 5494a4735 |
13 | 2acbcb478 |
14 | 18041c26d |
15 | d8bd38b2 |
hex | 8a5c8919 |
2321320217 has 2 divisors, whose sum is σ = 2321320218. Its totient is φ = 2321320216.
The previous prime is 2321320181. The next prime is 2321320229. The reversal of 2321320217 is 7120231232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1646411776 + 674908441 = 40576^2 + 25979^2 .
It is a cyclic number.
It is not a de Polignac number, because 2321320217 - 26 = 2321320153 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2321320192 and 2321320201.
It is not a weakly prime, because it can be changed into another prime (2321320237) 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, 1160660108 + 1160660109.
It is an arithmetic number, because the mean of its divisors is an integer number (1160660109).
Almost surely, 22321320217 is an apocalyptic number.
It is an amenable number.
2321320217 is a deficient number, since it is larger than the sum of its proper divisors (1).
2321320217 is an equidigital number, since it uses as much as digits as its factorization.
2321320217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 23.
The square root of 2321320217 is about 48180.0811228043. The cubic root of 2321320217 is about 1324.0722527983.
Adding to 2321320217 its reverse (7120231232), we get a palindrome (9441551449).
The spelling of 2321320217 in words is "two billion, three hundred twenty-one million, three hundred twenty thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •