Base | Representation |
---|---|
bin | 101110001000101110… |
… | …100111000000000000 |
3 | 11201212102112120221111 |
4 | 232020232213000000 |
5 | 1302423332410000 |
6 | 34431355133104 |
7 | 3402416545426 |
oct | 561056470000 |
9 | 151772476844 |
10 | 49538560000 |
11 | 1a011253386 |
12 | 9726444194 |
13 | 4896298bc7 |
14 | 257d335116 |
15 | 144e0e6cba |
hex | b88ba7000 |
49538560000 has 260 divisors, whose sum is σ = 127380468952. Its totient is φ = 19243008000.
The previous prime is 49538559977. The next prime is 49538560009. The reversal of 49538560000 is 6583594.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49538560009) 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 19 ways as a sum of consecutive naturals, for example, 94719739 + ... + 94720261.
Almost surely, 249538560000 is an apocalyptic number.
49538560000 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 49538560000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63690234476).
49538560000 is an abundant number, since it is smaller than the sum of its proper divisors (77841908952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49538560000 is an frugal number, since it uses more digits than its factorization.
49538560000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604 (or 567 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 40.
The spelling of 49538560000 in words is "forty-nine billion, five hundred thirty-eight million, five hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •