Base | Representation |
---|---|
bin | 101101101000110100… |
… | …110110010001010100 |
3 | 11200111010101210212110 |
4 | 231220310312101110 |
5 | 1300324322341000 |
6 | 34302315151020 |
7 | 3353230246164 |
oct | 555064662124 |
9 | 150433353773 |
10 | 49003324500 |
11 | 1986710aa99 |
12 | 95b7145470 |
13 | 480c427b00 |
14 | 252c20a5a4 |
15 | 141c11d850 |
hex | b68d36454 |
49003324500 has 576 divisors, whose sum is σ = 166787921664. Its totient is φ = 11134156800.
The previous prime is 49003324477. The next prime is 49003324543. The reversal of 49003324500 is 542330094.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 357688432 + ... + 357688568.
It is an arithmetic number, because the mean of its divisors is an integer number (289562364).
Almost surely, 249003324500 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 49003324500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83393960832).
49003324500 is an abundant number, since it is smaller than the sum of its proper divisors (117784597164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49003324500 is a wasteful number, since it uses less digits than its factorization.
49003324500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285 (or 260 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 49003324500 its reverse (542330094), we get a palindrome (49545654594).
The spelling of 49003324500 in words is "forty-nine billion, three million, three hundred twenty-four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •