Base | Representation |
---|---|
bin | 10011100111000… |
… | …011011101110000 |
3 | 211221002011220010 |
4 | 103213003131300 |
5 | 1133211124122 |
6 | 52351414520 |
7 | 11103331665 |
oct | 2347033560 |
9 | 757064803 |
10 | 329004912 |
11 | 159795295 |
12 | 92224440 |
13 | 53214b82 |
14 | 319a3a6c |
15 | 1dd3ce0c |
hex | 139c3770 |
329004912 has 80 divisors (see below), whose sum is σ = 907441920. Its totient is φ = 102412800.
The previous prime is 329004899. The next prime is 329004937. The reversal of 329004912 is 219400923.
329004912 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 329004912.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 62212 + ... + 67292.
It is an arithmetic number, because the mean of its divisors is an integer number (11343024).
Almost surely, 2329004912 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 329004912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (453720960).
329004912 is an abundant number, since it is smaller than the sum of its proper divisors (578437008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
329004912 is a wasteful number, since it uses less digits than its factorization.
329004912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5182 (or 5176 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 30.
The square root of 329004912 is about 18138.4925503747. The cubic root of 329004912 is about 690.3470298038.
The spelling of 329004912 in words is "three hundred twenty-nine million, four thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •