Base | Representation |
---|---|
bin | 1011101100100… |
… | …0110100100101 |
3 | 10102022100122012 |
4 | 2323020310211 |
5 | 100024311221 |
6 | 4511244005 |
7 | 1133656334 |
oct | 273106445 |
9 | 112270565 |
10 | 49057061 |
11 | 25767329 |
12 | 14519605 |
13 | a218161 |
14 | 672dd1b |
15 | 449065b |
hex | 2ec8d25 |
49057061 has 2 divisors, whose sum is σ = 49057062. Its totient is φ = 49057060.
The previous prime is 49057051. The next prime is 49057093. The reversal of 49057061 is 16075094.
It is a happy number.
49057061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (49057093) can be obtained adding 49057061 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42837025 + 6220036 = 6545^2 + 2494^2 .
It is a cyclic number.
It is not a de Polignac number, because 49057061 - 210 = 49056037 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49057051) 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 as a sum of consecutive naturals, namely, 24528530 + 24528531.
It is an arithmetic number, because the mean of its divisors is an integer number (24528531).
Almost surely, 249057061 is an apocalyptic number.
It is an amenable number.
49057061 is a deficient number, since it is larger than the sum of its proper divisors (1).
49057061 is an equidigital number, since it uses as much as digits as its factorization.
49057061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The square root of 49057061 is about 7004.0745998312. The cubic root of 49057061 is about 366.0725591956.
The spelling of 49057061 in words is "forty-nine million, fifty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •