Base | Representation |
---|---|
bin | 10011011100100… |
… | …011001001110000 |
3 | 211201220021101211 |
4 | 103130203021300 |
5 | 1132010013440 |
6 | 52212405504 |
7 | 11041042306 |
oct | 2334431160 |
9 | 751807354 |
10 | 326251120 |
11 | 158184328 |
12 | 91316894 |
13 | 5278c600 |
14 | 31488276 |
15 | 1d996eea |
hex | 13723270 |
326251120 has 120 divisors (see below), whose sum is σ = 837334800. Its totient is φ = 118130688.
The previous prime is 326251117. The next prime is 326251151. The reversal of 326251120 is 21152623.
It is a junction number, because it is equal to n+sod(n) for n = 326251091 and 326251100.
It is a congruent number.
It is an unprimeable number.
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, 797476 + ... + 797884.
It is an arithmetic number, because the mean of its divisors is an integer number (6977790).
Almost surely, 2326251120 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 326251120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (418667400).
326251120 is an abundant number, since it is smaller than the sum of its proper divisors (511083680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326251120 is a wasteful number, since it uses less digits than its factorization.
326251120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 507 (or 488 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 326251120 is about 18062.4228718076. The cubic root of 326251120 is about 688.4155480414.
The spelling of 326251120 in words is "three hundred twenty-six million, two hundred fifty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •