Base | Representation |
---|---|
bin | 10011100100111… |
… | …011101111110101 |
3 | 211220000221100021 |
4 | 103210323233311 |
5 | 1133040332023 |
6 | 52331445141 |
7 | 11065525204 |
oct | 2344735765 |
9 | 756027307 |
10 | 328449013 |
11 | 159445672 |
12 | 91bb67b1 |
13 | 5307bb39 |
14 | 3189b23b |
15 | 1dc7d35d |
hex | 1393bbf5 |
328449013 has 2 divisors, whose sum is σ = 328449014. Its totient is φ = 328449012.
The previous prime is 328448933. The next prime is 328449031. The reversal of 328449013 is 310944823.
Together with next prime (328449031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 212197489 + 116251524 = 14567^2 + 10782^2 .
It is a cyclic number.
It is not a de Polignac number, because 328449013 - 225 = 294894581 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 328449013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (328449413) 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, 164224506 + 164224507.
It is an arithmetic number, because the mean of its divisors is an integer number (164224507).
Almost surely, 2328449013 is an apocalyptic number.
It is an amenable number.
328449013 is a deficient number, since it is larger than the sum of its proper divisors (1).
328449013 is an equidigital number, since it uses as much as digits as its factorization.
328449013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 34.
The square root of 328449013 is about 18123.1623344272. The cubic root of 328449013 is about 689.9579985636.
The spelling of 328449013 in words is "three hundred twenty-eight million, four hundred forty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •