Base | Representation |
---|---|
bin | 1011110100010… |
… | …1010011101000 |
3 | 10110021021002001 |
4 | 2331011103220 |
5 | 100142120302 |
6 | 4530220344 |
7 | 1141212031 |
oct | 275052350 |
9 | 113237061 |
10 | 49566952 |
11 | 25a85426 |
12 | 147246b4 |
13 | a366276 |
14 | 6823a88 |
15 | 4541787 |
hex | 2f454e8 |
49566952 has 32 divisors (see below), whose sum is σ = 95483520. Its totient is φ = 24111360.
The previous prime is 49566949. The next prime is 49566989. The reversal of 49566952 is 25966594.
49566952 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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, 90343 + ... + 90889.
It is an arithmetic number, because the mean of its divisors is an integer number (2983860).
Almost surely, 249566952 is an apocalyptic number.
It is an amenable number.
49566952 is a deficient number, since it is larger than the sum of its proper divisors (45916568).
49566952 is a wasteful number, since it uses less digits than its factorization.
49566952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841 (or 837 counting only the distinct ones).
The product of its digits is 583200, while the sum is 46.
The square root of 49566952 is about 7040.3801033751. The cubic root of 49566952 is about 367.3364894955.
The spelling of 49566952 in words is "forty-nine million, five hundred sixty-six thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •