Base | Representation |
---|---|
bin | 110000011110011100… |
… | …101011101111110010 |
3 | 11222100111002110222110 |
4 | 300132130223233302 |
5 | 1323044403141000 |
6 | 35524525350150 |
7 | 3521600316261 |
oct | 603634535762 |
9 | 158314073873 |
10 | 52050443250 |
11 | 20090133453 |
12 | a107708356 |
13 | 4ba67c9160 |
14 | 273ab9a5d8 |
15 | 15498bd850 |
hex | c1e72bbf2 |
52050443250 has 128 divisors (see below), whose sum is σ = 145995333120. Its totient is φ = 12255302400.
The previous prime is 52050443177. The next prime is 52050443293. The reversal of 52050443250 is 5234405025.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 108196 + ... + 340304.
It is an arithmetic number, because the mean of its divisors is an integer number (1140588540).
Almost surely, 252050443250 is an apocalyptic number.
52050443250 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 52050443250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72997666560).
52050443250 is an abundant number, since it is smaller than the sum of its proper divisors (93944889870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52050443250 is a wasteful number, since it uses less digits than its factorization.
52050443250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232165 (or 232155 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 30.
Adding to 52050443250 its reverse (5234405025), we get a palindrome (57284848275).
The spelling of 52050443250 in words is "fifty-two billion, fifty million, four hundred forty-three thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •