Base | Representation |
---|---|
bin | 1001100001000101100… |
… | …10001000000000000000 |
3 | 1011021001021020000000000 |
4 | 10300202302020000000 |
5 | 20324144234023213 |
6 | 410120000000000 |
7 | 32424251213544 |
oct | 4604262100000 |
9 | 1137037200000 |
10 | 327001079808 |
11 | 116753648197 |
12 | 53460000000 |
13 | 24ab3ac9b00 |
14 | 11b81185a24 |
15 | 878cda8c73 |
hex | 4c22c88000 |
327001079808 has 528 divisors, whose sum is σ = 1062247574565. Its totient is φ = 100615716864.
The previous prime is 327001079803. The next prime is 327001079827. The reversal of 327001079808 is 808970100723.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 279595597824 + 47405481984 = 528768^2 + 217728^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=404352.
It is not an unprimeable number, because it can be changed into a prime (327001079803) by changing a digit.
It is a polite number, since it can be written in 32 ways as a sum of consecutive naturals, for example, 25153929210 + ... + 25153929222.
Almost surely, 2327001079808 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 327001079808
327001079808 is an abundant number, since it is smaller than the sum of its proper divisors (735246494757).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
327001079808 is an frugal number, since it uses more digits than its factorization.
327001079808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86 (or 18 counting only the distinct ones).
The product of its (nonzero) digits is 169344, while the sum is 45.
The spelling of 327001079808 in words is "three hundred twenty-seven billion, one million, seventy-nine thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •