Base | Representation |
---|---|
bin | 1011101100100… |
… | …0110001011001 |
3 | 10102022100100122 |
4 | 2323020301121 |
5 | 100024304412 |
6 | 4511243025 |
7 | 1133655623 |
oct | 273106131 |
9 | 112270318 |
10 | 49056857 |
11 | 25767163 |
12 | 14519475 |
13 | a218035 |
14 | 672dc13 |
15 | 4490572 |
hex | 2ec8c59 |
49056857 has 4 divisors (see below), whose sum is σ = 50382756. Its totient is φ = 47730960.
The previous prime is 49056827. The next prime is 49056863. The reversal of 49056857 is 75865094.
49056857 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 43771456 + 5285401 = 6616^2 + 2299^2 .
It is a cyclic number.
It is not a de Polignac number, because 49056857 - 26 = 49056793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49056827) 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 3 ways as a sum of consecutive naturals, for example, 662894 + ... + 662967.
It is an arithmetic number, because the mean of its divisors is an integer number (12595689).
Almost surely, 249056857 is an apocalyptic number.
It is an amenable number.
49056857 is a deficient number, since it is larger than the sum of its proper divisors (1325899).
49056857 is a wasteful number, since it uses less digits than its factorization.
49056857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1325898.
The product of its (nonzero) digits is 302400, while the sum is 44.
The square root of 49056857 is about 7004.0600368643. The cubic root of 49056857 is about 366.0720517668.
The spelling of 49056857 in words is "forty-nine million, fifty-six thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •