Base | Representation |
---|---|
bin | 110000100001101010… |
… | …010100101011101000 |
3 | 11222111020112020202001 |
4 | 300201222110223220 |
5 | 1323202203203230 |
6 | 35534133020344 |
7 | 3523123446142 |
oct | 604152245350 |
9 | 158436466661 |
10 | 52104350440 |
11 | 2010860274a |
12 | a1217846b4 |
13 | 4bb4a21abc |
14 | 2743dcdc92 |
15 | 154e4bb0ca |
hex | c21a94ae8 |
52104350440 has 128 divisors (see below), whose sum is σ = 121575168000. Its totient is φ = 20084762880.
The previous prime is 52104350429. The next prime is 52104350449. The reversal of 52104350440 is 4405340125.
It is a junction number, because it is equal to n+sod(n) for n = 52104350399 and 52104350408.
It is not an unprimeable number, because it can be changed into a prime (52104350449) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 86985261 + ... + 86985859.
It is an arithmetic number, because the mean of its divisors is an integer number (949806000).
Almost surely, 252104350440 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 52104350440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60787584000).
52104350440 is an abundant number, since it is smaller than the sum of its proper divisors (69470817560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52104350440 is a wasteful number, since it uses less digits than its factorization.
52104350440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1247 (or 1243 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 28.
Adding to 52104350440 its reverse (4405340125), we get a palindrome (56509690565).
The spelling of 52104350440 in words is "fifty-two billion, one hundred four million, three hundred fifty thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •