Base | Representation |
---|---|
bin | 1011101101001… |
… | …0011001000101 |
3 | 10102101100102001 |
4 | 2323102121011 |
5 | 100032040021 |
6 | 4512145301 |
7 | 1134211534 |
oct | 273223105 |
9 | 112340361 |
10 | 49096261 |
11 | 25793825 |
12 | 14538231 |
13 | a22cc56 |
14 | 674031b |
15 | 449c091 |
hex | 2ed2645 |
49096261 has 2 divisors, whose sum is σ = 49096262. Its totient is φ = 49096260.
The previous prime is 49096253. The next prime is 49096303. The reversal of 49096261 is 16269094.
49096261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 40132225 + 8964036 = 6335^2 + 2994^2 .
It is a cyclic number.
It is not a de Polignac number, because 49096261 - 23 = 49096253 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 49096261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49096211) 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, 24548130 + 24548131.
It is an arithmetic number, because the mean of its divisors is an integer number (24548131).
Almost surely, 249096261 is an apocalyptic number.
It is an amenable number.
49096261 is a deficient number, since it is larger than the sum of its proper divisors (1).
49096261 is an equidigital number, since it uses as much as digits as its factorization.
49096261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 37.
The square root of 49096261 is about 7006.8724121394. The cubic root of 49096261 is about 366.1700390385.
The spelling of 49096261 in words is "forty-nine million, ninety-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •