Base | Representation |
---|---|
bin | 101110101011000101… |
… | …101010011000000000 |
3 | 11210100121021020000221 |
4 | 232223011222120000 |
5 | 1310113421402410 |
6 | 35004510552424 |
7 | 3422616466516 |
oct | 565305523000 |
9 | 153317236027 |
10 | 50115028480 |
11 | 1a287699710 |
12 | 9867508714 |
13 | 4958845b0a |
14 | 25d5b144b6 |
15 | 1484a174da |
hex | bab16a600 |
50115028480 has 160 divisors (see below), whose sum is σ = 131775592608. Its totient is φ = 18127257600.
The previous prime is 50115028459. The next prime is 50115028487. The reversal of 50115028480 is 8482051105.
It is a tau number, because it is divible by the number of its divisors (160).
It is a super-2 number, since 2×501150284802 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50115028487) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5430270 + ... + 5439490.
Almost surely, 250115028480 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 50115028480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65887796304).
50115028480 is an abundant number, since it is smaller than the sum of its proper divisors (81660564128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50115028480 is a wasteful number, since it uses less digits than its factorization.
50115028480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9448 (or 9432 counting only the distinct ones).
The product of its (nonzero) digits is 12800, while the sum is 34.
Adding to 50115028480 its reverse (8482051105), we get a palindrome (58597079585).
The spelling of 50115028480 in words is "fifty billion, one hundred fifteen million, twenty-eight thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •