Base | Representation |
---|---|
bin | 10111101100101101001… |
… | …10111101110110000000 |
3 | 2212211210021020011210220 |
4 | 23312112212331312000 |
5 | 101320114024204003 |
6 | 1422023440223040 |
7 | 112554336352062 |
oct | 13662646756600 |
9 | 2784707204726 |
10 | 814275616128 |
11 | 2943723a2457 |
12 | 11198b30aa80 |
13 | 5ba2a6c9700 |
14 | 2b5a82a5732 |
15 | 162ab719353 |
hex | bd969bdd80 |
814275616128 has 192 divisors, whose sum is σ = 2345653183680. Its totient is φ = 250165893120.
The previous prime is 814275616127. The next prime is 814275616153. The reversal of 814275616128 is 821616572418.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (192).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (814275616127) 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, 44314783 + ... + 44333153.
It is an arithmetic number, because the mean of its divisors is an integer number (12216943665).
Almost surely, 2814275616128 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 814275616128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1172826591840).
814275616128 is an abundant number, since it is smaller than the sum of its proper divisors (1531377567552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
814275616128 is a wasteful number, since it uses less digits than its factorization.
814275616128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19097 (or 19072 counting only the distinct ones).
The product of its digits is 1290240, while the sum is 51.
The spelling of 814275616128 in words is "eight hundred fourteen billion, two hundred seventy-five million, six hundred sixteen thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •