Base | Representation |
---|---|
bin | 1011101100001… |
… | …0111101111000 |
3 | 10102021010202000 |
4 | 2323002331320 |
5 | 100023024310 |
6 | 4510541000 |
7 | 1133526405 |
oct | 273027570 |
9 | 112233660 |
10 | 49033080 |
11 | 25750308 |
12 | 14507760 |
13 | a20a275 |
14 | 67252ac |
15 | 44884c0 |
hex | 2ec2f78 |
49033080 has 128 divisors (see below), whose sum is σ = 165715200. Its totient is φ = 12894336.
The previous prime is 49033057. The next prime is 49033087. The reversal of 49033080 is 8033094.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49033087) 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, 89367 + ... + 89913.
It is an arithmetic number, because the mean of its divisors is an integer number (1294650).
Almost surely, 249033080 is an apocalyptic number.
49033080 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 49033080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82857600).
49033080 is an abundant number, since it is smaller than the sum of its proper divisors (116682120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49033080 is a wasteful number, since it uses less digits than its factorization.
49033080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 650 (or 640 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 49033080 is about 7002.3624584850. The cubic root of 49033080 is about 366.0128993035.
The spelling of 49033080 in words is "forty-nine million, thirty-three thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •