Base | Representation |
---|---|
bin | 10011100011011… |
… | …101011000101111 |
3 | 211212022022011101 |
4 | 103203131120233 |
5 | 1132441000021 |
6 | 52315303531 |
7 | 11062325320 |
oct | 2343353057 |
9 | 755268141 |
10 | 328062511 |
11 | 159201247 |
12 | 91a4aba7 |
13 | 52c74c3a |
14 | 317da447 |
15 | 1dc03a91 |
hex | 138dd62f |
328062511 has 16 divisors (see below), whose sum is σ = 381250368. Its totient is φ = 276480000.
The previous prime is 328062509. The next prime is 328062517. The reversal of 328062511 is 115260823.
It is a 14-Lehmer number, since φ(328062511) divides (328062511-1)14.
It is a cyclic number.
It is not a de Polignac number, because 328062511 - 21 = 328062509 is a prime.
It is a super-2 number, since 2×3280625112 = 215250022247250242, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 328062511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (328062517) 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 in 15 ways as a sum of consecutive naturals, for example, 204111 + ... + 205711.
It is an arithmetic number, because the mean of its divisors is an integer number (23828148).
Almost surely, 2328062511 is an apocalyptic number.
328062511 is a deficient number, since it is larger than the sum of its proper divisors (53187857).
328062511 is a wasteful number, since it uses less digits than its factorization.
328062511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2082.
The product of its (nonzero) digits is 2880, while the sum is 28.
The square root of 328062511 is about 18112.4959903377. The cubic root of 328062511 is about 689.6872565757.
The spelling of 328062511 in words is "three hundred twenty-eight million, sixty-two thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •