Base | Representation |
---|---|
bin | 101111000010001001… |
… | …111111111001110000 |
3 | 11211100120111111200101 |
4 | 233002021333321300 |
5 | 1311412010304300 |
6 | 35111134002144 |
7 | 3435326160502 |
oct | 570211777160 |
9 | 154316444611 |
10 | 50502041200 |
11 | 1a4660a4036 |
12 | 9955046354 |
13 | 49baa8ac20 |
14 | 2631297d72 |
15 | 14a89b2b6a |
hex | bc227fe70 |
50502041200 has 240 divisors, whose sum is σ = 134327964960. Its totient is φ = 18131189760.
The previous prime is 50502041197. The next prime is 50502041201. The reversal of 50502041200 is 214020505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50502041201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 29758752 + ... + 29760448.
It is an arithmetic number, because the mean of its divisors is an integer number (559699854).
Almost surely, 250502041200 is an apocalyptic number.
50502041200 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 50502041200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67163982480).
50502041200 is an abundant number, since it is smaller than the sum of its proper divisors (83825923760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50502041200 is a wasteful number, since it uses less digits than its factorization.
50502041200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1884 (or 1873 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 19.
Adding to 50502041200 its reverse (214020505), we get a palindrome (50716061705).
The spelling of 50502041200 in words is "fifty billion, five hundred two million, forty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •