Base | Representation |
---|---|
bin | 10111011101110011101000… |
… | …10100000101100110001000 |
3 | 20202201001222101200021222210 |
4 | 23232321310110011212020 |
5 | 23230420224230021000 |
6 | 301425253300545120 |
7 | 13604045642243226 |
oct | 1356716424054610 |
9 | 222631871607883 |
10 | 51601688517000 |
11 | 15495175a07376 |
12 | 59549050b21a0 |
13 | 22a40314049ab |
14 | ca576c26bb16 |
15 | 5e74295ca350 |
hex | 2eee74505988 |
51601688517000 has 256 divisors, whose sum is σ = 171374991840000. Its totient is φ = 12889740441600.
The previous prime is 51601688516971. The next prime is 51601688517031. The reversal of 51601688517000 is 71588610615.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12915 + ... + 10158914.
It is an arithmetic number, because the mean of its divisors is an integer number (669433561875).
Almost surely, 251601688517000 is an apocalyptic number.
51601688517000 is a gapful number since it is divisible by the number (50) 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 51601688517000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85687495920000).
51601688517000 is an abundant number, since it is smaller than the sum of its proper divisors (119773303323000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51601688517000 is a wasteful number, since it uses less digits than its factorization.
51601688517000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10171961 (or 10171947 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 48.
The spelling of 51601688517000 in words is "fifty-one trillion, six hundred one billion, six hundred eighty-eight million, five hundred seventeen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •