Base | Representation |
---|---|
bin | 1011110011101… |
… | …0010100000000 |
3 | 10110011222022012 |
4 | 2330322110000 |
5 | 100134200140 |
6 | 4525232052 |
7 | 1140633530 |
oct | 274722400 |
9 | 113158265 |
10 | 49521920 |
11 | 25a54608 |
12 | 14702628 |
13 | a34b916 |
14 | 68114c0 |
15 | 4533265 |
hex | 2f3a500 |
49521920 has 72 divisors (see below), whose sum is σ = 135590784. Its totient is φ = 16975872.
The previous prime is 49521919. The next prime is 49521929. The reversal of 49521920 is 2912594.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49521929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6197 + ... + 11723.
Almost surely, 249521920 is an apocalyptic number.
49521920 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 49521920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67795392).
49521920 is an abundant number, since it is smaller than the sum of its proper divisors (86068864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49521920 is an equidigital number, since it uses as much as digits as its factorization.
49521920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5555 (or 5541 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 32.
The square root of 49521920 is about 7037.1812538828. The cubic root of 49521920 is about 367.2252130089.
The spelling of 49521920 in words is "forty-nine million, five hundred twenty-one thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •