Base | Representation |
---|---|
bin | 101110011100110100… |
… | …000010001100000000 |
3 | 11202201220121020221112 |
4 | 232130310002030000 |
5 | 1304121113321100 |
6 | 34525033342452 |
7 | 3413650656650 |
oct | 563464021400 |
9 | 152656536845 |
10 | 49875526400 |
11 | 1a174486207 |
12 | 97bb267a28 |
13 | 491b03a7cb |
14 | 25b1dac360 |
15 | 146d9a8b35 |
hex | b9cd02300 |
49875526400 has 216 divisors, whose sum is σ = 144903329760. Its totient is φ = 16637460480.
The previous prime is 49875526399. The next prime is 49875526403. The reversal of 49875526400 is 462557894.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is not an unprimeable number, because it can be changed into a prime (49875526403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1642556 + ... + 1672644.
Almost surely, 249875526400 is an apocalyptic number.
49875526400 is a gapful number since it is divisible by the number (40) 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 49875526400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72451664880).
49875526400 is an abundant number, since it is smaller than the sum of its proper divisors (95027803360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49875526400 is a wasteful number, since it uses less digits than its factorization.
49875526400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30159 (or 30140 counting only the distinct ones).
The product of its (nonzero) digits is 2419200, while the sum is 50.
The spelling of 49875526400 in words is "forty-nine billion, eight hundred seventy-five million, five hundred twenty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •