Base | Representation |
---|---|
bin | 10111000000111001010000… |
… | …10101111000111100100000 |
3 | 20122012002210210122211212101 |
4 | 23200130220111320330200 |
5 | 23113131222234210210 |
6 | 255345042105140144 |
7 | 13442220161230630 |
oct | 1340345025707440 |
9 | 218162723584771 |
10 | 50608276475680 |
11 | 15141938796330 |
12 | 581428148a654 |
13 | 2231455c75a71 |
14 | c6d64cb646c0 |
15 | 5cb6863dba3a |
hex | 2e0728578f20 |
50608276475680 has 768 divisors, whose sum is σ = 162570530304000. Its totient is φ = 14406277939200.
The previous prime is 50608276475633. The next prime is 50608276475707. The reversal of 50608276475680 is 8657467280605.
It is a happy number.
It is a super-2 number, since 2×506082764756802 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4690723726 + ... + 4690734514.
It is an arithmetic number, because the mean of its divisors is an integer number (211680378000).
Almost surely, 250608276475680 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 50608276475680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81285265152000).
50608276475680 is an abundant number, since it is smaller than the sum of its proper divisors (111962253828320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50608276475680 is a wasteful number, since it uses less digits than its factorization.
50608276475680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11561 (or 11553 counting only the distinct ones).
The product of its (nonzero) digits is 135475200, while the sum is 64.
The spelling of 50608276475680 in words is "fifty trillion, six hundred eight billion, two hundred seventy-six million, four hundred seventy-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •