Base | Representation |
---|---|
bin | 101110111000000010… |
… | …010110101101000000 |
3 | 11210220202000222220100 |
4 | 232320002112231000 |
5 | 1311040024442110 |
6 | 35042231042400 |
7 | 3431165124123 |
oct | 567002265500 |
9 | 153822028810 |
10 | 50332265280 |
11 | 1a389284960 |
12 | 9908210400 |
13 | 49918568bb |
14 | 26169023ba |
15 | 1498b28bc0 |
hex | bb8096b40 |
50332265280 has 672 divisors, whose sum is σ = 200207075328. Its totient is φ = 11485900800.
The previous prime is 50332265251. The next prime is 50332265281. The reversal of 50332265280 is 8256223305.
50332265280 is a `hidden beast` number, since 50 + 3 + 322 + 6 + 5 + 280 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50332265281) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 48818365 + ... + 48819395.
Almost surely, 250332265280 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 50332265280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100103537664).
50332265280 is an abundant number, since it is smaller than the sum of its proper divisors (149874810048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50332265280 is a wasteful number, since it uses less digits than its factorization.
50332265280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1155 (or 1142 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
Adding to 50332265280 its reverse (8256223305), we get a palindrome (58588488585).
The spelling of 50332265280 in words is "fifty billion, three hundred thirty-two million, two hundred sixty-five thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •