Base | Representation |
---|---|
bin | 1011110100101… |
… | …1001101100101 |
3 | 10110022111020221 |
4 | 2331023031211 |
5 | 100143404031 |
6 | 4530524341 |
7 | 1141342405 |
oct | 275131545 |
9 | 113274227 |
10 | 49591141 |
11 | 25aa1616 |
12 | 147366b1 |
13 | a374292 |
14 | 682c805 |
15 | 4548a11 |
hex | 2f4b365 |
49591141 has 2 divisors, whose sum is σ = 49591142. Its totient is φ = 49591140.
The previous prime is 49591133. The next prime is 49591147. The reversal of 49591141 is 14119594.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27772900 + 21818241 = 5270^2 + 4671^2 .
It is a cyclic number.
It is not a de Polignac number, because 49591141 - 23 = 49591133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 49591097 and 49591106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49591147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24795570 + 24795571.
It is an arithmetic number, because the mean of its divisors is an integer number (24795571).
Almost surely, 249591141 is an apocalyptic number.
It is an amenable number.
49591141 is a deficient number, since it is larger than the sum of its proper divisors (1).
49591141 is an equidigital number, since it uses as much as digits as its factorization.
49591141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6480, while the sum is 34.
The square root of 49591141 is about 7042.0977698410. The cubic root of 49591141 is about 367.3962339891.
The spelling of 49591141 in words is "forty-nine million, five hundred ninety-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •