Base | Representation |
---|---|
bin | 101110111101100000… |
… | …110011101001101010 |
3 | 11211011010220102102210 |
4 | 232331200303221222 |
5 | 1311232034244000 |
6 | 35055312105550 |
7 | 3433362032520 |
oct | 567540635152 |
9 | 154133812383 |
10 | 50424134250 |
11 | 1a426122426 |
12 | 9932b352b6 |
13 | 49a78b1439 |
14 | 2624bb8310 |
15 | 14a1c24350 |
hex | bbd833a6a |
50424134250 has 256 divisors, whose sum is σ = 149556326400. Its totient is φ = 11071468800.
The previous prime is 50424134179. The next prime is 50424134263. The reversal of 50424134250 is 5243142405.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
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, 34560021 + ... + 34561479.
It is an arithmetic number, because the mean of its divisors is an integer number (584204400).
Almost surely, 250424134250 is an apocalyptic number.
50424134250 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 50424134250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74778163200).
50424134250 is an abundant number, since it is smaller than the sum of its proper divisors (99132192150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50424134250 is a wasteful number, since it uses less digits than its factorization.
50424134250 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1742 (or 1732 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
Adding to 50424134250 its reverse (5243142405), we get a palindrome (55667276655).
The spelling of 50424134250 in words is "fifty billion, four hundred twenty-four million, one hundred thirty-four thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •