Base | Representation |
---|---|
bin | 10011111111110110110011… |
… | …101100100101100101010000 |
3 | 102112102001001121020110000020 |
4 | 103333312303230211211100 |
5 | 43011442232343131003 |
6 | 511020054221223440 |
7 | 24345153155113326 |
oct | 2377666354454520 |
9 | 375361047213006 |
10 | 87951060130128 |
11 | 26029920622828 |
12 | 9a45608101b80 |
13 | 3a0c998517aa0 |
14 | 17a0bd5623d16 |
15 | a27c20116d53 |
hex | 4ffdb3b25950 |
87951060130128 has 160 divisors (see below), whose sum is σ = 246096268830720. Its totient is φ = 26905859604480.
The previous prime is 87951060130121. The next prime is 87951060130133. The reversal of 87951060130128 is 82103106015978.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (87951060130121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 224943250 + ... + 225333902.
It is an arithmetic number, because the mean of its divisors is an integer number (1538101680192).
Almost surely, 287951060130128 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 87951060130128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123048134415360).
87951060130128 is an abundant number, since it is smaller than the sum of its proper divisors (158145208700592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87951060130128 is a wasteful number, since it uses less digits than its factorization.
87951060130128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392757 (or 392751 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 51.
The spelling of 87951060130128 in words is "eighty-seven trillion, nine hundred fifty-one billion, sixty million, one hundred thirty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •