Base | Representation |
---|---|
bin | 10011011110110… |
… | …000101001011000 |
3 | 211202222201102000 |
4 | 103132300221120 |
5 | 1132132040210 |
6 | 52233041000 |
7 | 11046005061 |
oct | 2336605130 |
9 | 752881360 |
10 | 326830680 |
11 | 15853a800 |
12 | 91556160 |
13 | 52933347 |
14 | 31599568 |
15 | 1da5dac0 |
hex | 137b0a58 |
326830680 has 384 divisors, whose sum is σ = 1246795200. Its totient is φ = 76032000.
The previous prime is 326830649. The next prime is 326830703. The reversal of 326830680 is 86038623.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5357850 + ... + 5357910.
Almost surely, 2326830680 is an apocalyptic number.
326830680 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 326830680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (623397600).
326830680 is an abundant number, since it is smaller than the sum of its proper divisors (919964520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326830680 is a wasteful number, since it uses less digits than its factorization.
326830680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144 (or 123 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 36.
The square root of 326830680 is about 18078.4590051254. The cubic root of 326830680 is about 688.8229459753.
The spelling of 326830680 in words is "three hundred twenty-six million, eight hundred thirty thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •