Base | Representation |
---|---|
bin | 10111100101011100110… |
… | …10111000000000000000 |
3 | 2212110201210012002200000 |
4 | 23302232122320000000 |
5 | 101234124303213402 |
6 | 1420141122400000 |
7 | 112355655320400 |
oct | 13625632700000 |
9 | 2773653162600 |
10 | 810380132352 |
11 | 29275350487a |
12 | 111082800000 |
13 | 5b55964031b |
14 | 2b318b9a800 |
15 | 1612e73bc1c |
hex | bcae6b8000 |
810380132352 has 1152 divisors, whose sum is σ = 2958751111680. Its totient is φ = 220723937280.
The previous prime is 810380132329. The next prime is 810380132363. The reversal of 810380132352 is 253231083018.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (1152).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 12095225823 + ... + 12095225889.
It is an arithmetic number, because the mean of its divisors is an integer number (2568360340).
Almost surely, 2810380132352 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 810380132352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1479375555840).
810380132352 is an abundant number, since it is smaller than the sum of its proper divisors (2148370979328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
810380132352 is an frugal number, since it uses more digits than its factorization.
810380132352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157 (or 110 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The spelling of 810380132352 in words is "eight hundred ten billion, three hundred eighty million, one hundred thirty-two thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •