Base | Representation |
---|---|
bin | 1011110011010… |
… | …1110101000000 |
3 | 10110011001002220 |
4 | 2330311311000 |
5 | 100133103202 |
6 | 4525011040 |
7 | 1140526140 |
oct | 274656500 |
9 | 113131086 |
10 | 49503552 |
11 | 25a4182a |
12 | 146b3a80 |
13 | a343457 |
14 | 6808920 |
15 | 452cabc |
hex | 2f35d40 |
49503552 has 56 divisors (see below), whose sum is σ = 149693376. Its totient is φ = 14143488.
The previous prime is 49503527. The next prime is 49503557. The reversal of 49503552 is 25530594.
49503552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (56).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49503557) 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 7 ways as a sum of consecutive naturals, for example, 17073 + ... + 19760.
It is an arithmetic number, because the mean of its divisors is an integer number (2673096).
Almost surely, 249503552 is an apocalyptic number.
49503552 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
49503552 is an abundant number, since it is smaller than the sum of its proper divisors (100189824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49503552 is a wasteful number, since it uses less digits than its factorization.
49503552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36855 (or 36845 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 33.
The square root of 49503552 is about 7035.8760648550. The cubic root of 49503552 is about 367.1798053266.
The spelling of 49503552 in words is "forty-nine million, five hundred three thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •