Base | Representation |
---|---|
bin | 10011011100100… |
… | …011100101000000 |
3 | 211201220100210102 |
4 | 103130203211000 |
5 | 1132010042424 |
6 | 52212421532 |
7 | 11041050350 |
oct | 2334434500 |
9 | 751810712 |
10 | 326252864 |
11 | 158185673 |
12 | 913178a8 |
13 | 52790342 |
14 | 31488b60 |
15 | 1d9977ae |
hex | 13723940 |
326252864 has 56 divisors (see below), whose sum is σ = 741639360. Its totient is φ = 139493376.
The previous prime is 326252833. The next prime is 326252893. The reversal of 326252864 is 468252623.
326252864 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (56).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 344039 + ... + 344985.
It is an arithmetic number, because the mean of its divisors is an integer number (13243560).
Almost surely, 2326252864 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 326252864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (370819680).
326252864 is an abundant number, since it is smaller than the sum of its proper divisors (415386496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326252864 is an equidigital number, since it uses as much as digits as its factorization.
326252864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1735 (or 1725 counting only the distinct ones).
The product of its digits is 138240, while the sum is 38.
The square root of 326252864 is about 18062.4711487659. The cubic root of 326252864 is about 688.4167746983.
The spelling of 326252864 in words is "three hundred twenty-six million, two hundred fifty-two thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •