Base | Representation |
---|---|
bin | 1011110011110… |
… | …1111011111000 |
3 | 10110012201122211 |
4 | 2330331323320 |
5 | 100140134020 |
6 | 4525424504 |
7 | 1141025020 |
oct | 274757370 |
9 | 113181584 |
10 | 49536760 |
11 | 25a64779 |
12 | 1470b134 |
13 | a3555c0 |
14 | 6816a80 |
15 | 453785a |
hex | 2f3def8 |
49536760 has 128 divisors (see below), whose sum is σ = 141926400. Its totient is φ = 15137280.
The previous prime is 49536757. The next prime is 49536769. The reversal of 49536760 is 6763594.
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 (49536769) 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, 112621 + ... + 113059.
It is an arithmetic number, because the mean of its divisors is an integer number (1108800).
Almost surely, 249536760 is an apocalyptic number.
49536760 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 49536760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70963200).
49536760 is an abundant number, since it is smaller than the sum of its proper divisors (92389640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49536760 is a wasteful number, since it uses less digits than its factorization.
49536760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 501 (or 497 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 40.
The square root of 49536760 is about 7038.2355743467. The cubic root of 49536760 is about 367.2618908941.
The spelling of 49536760 in words is "forty-nine million, five hundred thirty-six thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •