Base | Representation |
---|---|
bin | 101101101000110100… |
… | …110100000000000000 |
3 | 11200111010101100010000 |
4 | 231220310310000000 |
5 | 1300324322041300 |
6 | 34302315040000 |
7 | 3353230210110 |
oct | 555064640000 |
9 | 150433340100 |
10 | 49003315200 |
11 | 19867104004 |
12 | 95b7140000 |
13 | 480c4237c8 |
14 | 252c207040 |
15 | 141c11ac00 |
hex | b68d34000 |
49003315200 has 900 divisors, whose sum is σ = 208453692832. Its totient is φ = 11147673600.
The previous prime is 49003315189. The next prime is 49003315213. The reversal of 49003315200 is 251330094.
It is a tau number, because it is divible by the number of its divisors (900).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 232243095 + ... + 232243305.
Almost surely, 249003315200 is an apocalyptic number.
49003315200 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 49003315200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (104226846416).
49003315200 is an abundant number, since it is smaller than the sum of its proper divisors (159450377632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49003315200 is an equidigital number, since it uses as much as digits as its factorization.
49003315200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268 (or 228 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 49003315200 its reverse (251330094), we get a palindrome (49254645294).
The spelling of 49003315200 in words is "forty-nine billion, three million, three hundred fifteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •