Base | Representation |
---|---|
bin | 10011011111000… |
… | …001111010011000 |
3 | 211210010022102021 |
4 | 103133001322120 |
5 | 1132141321100 |
6 | 52234344224 |
7 | 11046421210 |
oct | 2337017230 |
9 | 753108367 |
10 | 326901400 |
11 | 158588951 |
12 | 9158b074 |
13 | 529595a7 |
14 | 315b7240 |
15 | 1da74a1a |
hex | 137c1e98 |
326901400 has 96 divisors (see below), whose sum is σ = 877443840. Its totient is φ = 110943360.
The previous prime is 326901397. The next prime is 326901431. The reversal of 326901400 is 4109623.
326901400 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 143067 + ... + 145333.
It is an arithmetic number, because the mean of its divisors is an integer number (9140040).
Almost surely, 2326901400 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 326901400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (438721920).
326901400 is an abundant number, since it is smaller than the sum of its proper divisors (550542440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326901400 is a wasteful number, since it uses less digits than its factorization.
326901400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2393 (or 2384 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 326901400 is about 18080.4148182502. The cubic root of 326901400 is about 688.8726251604.
The spelling of 326901400 in words is "three hundred twenty-six million, nine hundred one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •