Base | Representation |
---|---|
bin | 10011011100010… |
… | …011000001111000 |
3 | 211201202220210220 |
4 | 103130103001320 |
5 | 1132000410310 |
6 | 52211140040 |
7 | 11040345624 |
oct | 2334230170 |
9 | 751686726 |
10 | 326185080 |
11 | 158139751 |
12 | 912a4620 |
13 | 52768530 |
14 | 3146c184 |
15 | 1d982670 |
hex | 13713078 |
326185080 has 128 divisors (see below), whose sum is σ = 1099768320. Its totient is φ = 76792320.
The previous prime is 326185043. The next prime is 326185133. The reversal of 326185080 is 80581623.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31335 + ... + 40425.
It is an arithmetic number, because the mean of its divisors is an integer number (8591940).
Almost surely, 2326185080 is an apocalyptic number.
326185080 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 326185080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (549884160).
326185080 is an abundant number, since it is smaller than the sum of its proper divisors (773583240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326185080 is a wasteful number, since it uses less digits than its factorization.
326185080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9141 (or 9137 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 326185080 is about 18060.5946745947. The cubic root of 326185080 is about 688.3690950406.
The spelling of 326185080 in words is "three hundred twenty-six million, one hundred eighty-five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •