Base | Representation |
---|---|
bin | 10011011101101… |
… | …101010110000100 |
3 | 211202110201021002 |
4 | 103131231112010 |
5 | 1132044230022 |
6 | 52223112432 |
7 | 11043446300 |
oct | 2335552604 |
9 | 752421232 |
10 | 326555012 |
11 | 158371683 |
12 | 91442718 |
13 | 52867a24 |
14 | 31526d00 |
15 | 1da07092 |
hex | 1376d584 |
326555012 has 72 divisors (see below), whose sum is σ = 701193024. Its totient is φ = 132420288.
The previous prime is 326554999. The next prime is 326555017. The reversal of 326555012 is 210555623.
It is a happy number.
326555012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (326555017) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 482018 + ... + 482694.
It is an arithmetic number, because the mean of its divisors is an integer number (9738792).
Almost surely, 2326555012 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 326555012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (350596512).
326555012 is an abundant number, since it is smaller than the sum of its proper divisors (374638012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326555012 is a wasteful number, since it uses less digits than its factorization.
326555012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 825 (or 816 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 29.
The square root of 326555012 is about 18070.8331849973. The cubic root of 326555012 is about 688.6292270584.
The spelling of 326555012 in words is "three hundred twenty-six million, five hundred fifty-five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •