Base | Representation |
---|---|
bin | 10011100110110… |
… | …111000011100000 |
3 | 211220222121011110 |
4 | 103212313003200 |
5 | 1133203012310 |
6 | 52350343320 |
7 | 11103030540 |
oct | 2346670340 |
9 | 756877143 |
10 | 328954080 |
11 | 159760084 |
12 | 921bab40 |
13 | 531c79b0 |
14 | 3198d320 |
15 | 1dd2cd20 |
hex | 139b70e0 |
328954080 has 384 divisors, whose sum is σ = 1353397248. Its totient is φ = 65175552.
The previous prime is 328954079. The next prime is 328954091. The reversal of 328954080 is 80459823.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 742339 + ... + 742781.
It is an arithmetic number, because the mean of its divisors is an integer number (3524472).
Almost surely, 2328954080 is an apocalyptic number.
328954080 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 328954080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (676698624).
328954080 is an abundant number, since it is smaller than the sum of its proper divisors (1024443168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
328954080 is a wasteful number, since it uses less digits than its factorization.
328954080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 498 (or 490 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 39.
The square root of 328954080 is about 18137.0912772694. The cubic root of 328954080 is about 690.3114745822.
The spelling of 328954080 in words is "three hundred twenty-eight million, nine hundred fifty-four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.282 sec. • engine limits •