Base | Representation |
---|---|
bin | 10010001011000… |
… | …101101101000000 |
3 | 210020201100211021 |
4 | 102023011231000 |
5 | 1111023144312 |
6 | 50130555224 |
7 | 10361403022 |
oct | 2213055500 |
9 | 706640737 |
10 | 304896832 |
11 | 147119559 |
12 | 86138b14 |
13 | 4b223936 |
14 | 2c6ca012 |
15 | 1bb79c07 |
hex | 122c5b40 |
304896832 has 56 divisors (see below), whose sum is σ = 646151616. Its totient is φ = 142399488.
The previous prime is 304896829. The next prime is 304896847. The reversal of 304896832 is 238698403.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60888 + ... + 65704.
Almost surely, 2304896832 is an apocalyptic number.
304896832 is a gapful number since it is divisible by the number (32) 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 304896832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (323075808).
304896832 is an abundant number, since it is smaller than the sum of its proper divisors (341254784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
304896832 is a wasteful number, since it uses less digits than its factorization.
304896832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4895 (or 4885 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 43.
The square root of 304896832 is about 17461.2952555073. The cubic root of 304896832 is about 673.0556442978.
The spelling of 304896832 in words is "three hundred four million, eight hundred ninety-six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •