Base | Representation |
---|---|
bin | 10011101110001… |
… | …010000011110000 |
3 | 212001120210002200 |
4 | 103232022003300 |
5 | 1134200220203 |
6 | 52455343200 |
7 | 11125215420 |
oct | 2356120360 |
9 | 761523080 |
10 | 330866928 |
11 | 15a847247 |
12 | 92981b00 |
13 | 53717562 |
14 | 31d2a480 |
15 | 1e0a99a3 |
hex | 13b8a0f0 |
330866928 has 120 divisors (see below), whose sum is σ = 1075797216. Its totient is φ = 92966400.
The previous prime is 330866927. The next prime is 330866933. The reversal of 330866928 is 829668033.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330866927) 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 in 23 ways as a sum of consecutive naturals, for example, 58798 + ... + 64178.
Almost surely, 2330866928 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 330866928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (537898608).
330866928 is an abundant number, since it is smaller than the sum of its proper divisors (744930288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330866928 is a wasteful number, since it uses less digits than its factorization.
330866928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5463 (or 5454 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 45.
The square root of 330866928 is about 18189.7478817052. The cubic root of 330866928 is about 691.6469291573.
The spelling of 330866928 in words is "three hundred thirty million, eight hundred sixty-six thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •