Base | Representation |
---|---|
bin | 10011011011010… |
… | …010011110010100 |
3 | 211201021111002120 |
4 | 103123102132110 |
5 | 1131413430120 |
6 | 52201335540 |
7 | 11035165002 |
oct | 2333223624 |
9 | 751244076 |
10 | 325920660 |
11 | 157a7901a |
12 | 911975b0 |
13 | 526a5080 |
14 | 313dda72 |
15 | 1d92e140 |
hex | 136d2794 |
325920660 has 96 divisors (see below), whose sum is σ = 986936832. Its totient is φ = 79887360.
The previous prime is 325920659. The next prime is 325920677. The reversal of 325920660 is 66029523.
It is a super-2 number, since 2×3259206602 = 212448553229671200, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 218437 + ... + 219923.
It is an arithmetic number, because the mean of its divisors is an integer number (10280592).
Almost surely, 2325920660 is an apocalyptic number.
325920660 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 325920660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (493468416).
325920660 is an abundant number, since it is smaller than the sum of its proper divisors (661016172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
325920660 is a wasteful number, since it uses less digits than its factorization.
325920660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1793 (or 1791 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 33.
The square root of 325920660 is about 18053.2728334781. The cubic root of 325920660 is about 688.1830373149.
The spelling of 325920660 in words is "three hundred twenty-five million, nine hundred twenty thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •