Base | Representation |
---|---|
bin | 1011110011110… |
… | …1111110100100 |
3 | 10110012201220012 |
4 | 2330331332210 |
5 | 100140140212 |
6 | 4525425352 |
7 | 1141025354 |
oct | 274757644 |
9 | 113181805 |
10 | 49536932 |
11 | 25a64915 |
12 | 1470b258 |
13 | a3556c3 |
14 | 6816b64 |
15 | 4537922 |
hex | 2f3dfa4 |
49536932 has 24 divisors (see below), whose sum is σ = 89353656. Its totient is φ = 24012288.
The previous prime is 49536887. The next prime is 49536937. The reversal of 49536932 is 23963594.
It can be written as a sum of positive squares in 4 ways, for example, as 872356 + 48664576 = 934^2 + 6976^2 .
It is a Smith number, since the sum of its digits (41) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 49536932.
It is not an unprimeable number, because it can be changed into a prime (49536937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63698 + ... + 64470.
It is an arithmetic number, because the mean of its divisors is an integer number (3723069).
Almost surely, 249536932 is an apocalyptic number.
It is an amenable number.
49536932 is a deficient number, since it is larger than the sum of its proper divisors (39816724).
49536932 is a wasteful number, since it uses less digits than its factorization.
49536932 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1247 (or 1245 counting only the distinct ones).
The product of its digits is 174960, while the sum is 41.
The square root of 49536932 is about 7038.2477933076. The cubic root of 49536932 is about 367.2623159588.
The spelling of 49536932 in words is "forty-nine million, five hundred thirty-six thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •