Base | Representation |
---|---|
bin | 1011101011111… |
… | …0101010101101 |
3 | 10102020020120202 |
4 | 2322332222231 |
5 | 100021443334 |
6 | 4510323245 |
7 | 1133424146 |
oct | 272765255 |
9 | 112206522 |
10 | 49015469 |
11 | 25739058 |
12 | 144b9525 |
13 | a202249 |
14 | 671cacd |
15 | 448317e |
hex | 2ebeaad |
49015469 has 2 divisors, whose sum is σ = 49015470. Its totient is φ = 49015468.
The previous prime is 49015457. The next prime is 49015559. The reversal of 49015469 is 96451094.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29106025 + 19909444 = 5395^2 + 4462^2 .
It is a cyclic number.
It is not a de Polignac number, because 49015469 - 212 = 49011373 is a prime.
It is a super-2 number, since 2×490154692 = 4805032402579922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49015409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24507734 + 24507735.
It is an arithmetic number, because the mean of its divisors is an integer number (24507735).
Almost surely, 249015469 is an apocalyptic number.
It is an amenable number.
49015469 is a deficient number, since it is larger than the sum of its proper divisors (1).
49015469 is an equidigital number, since it uses as much as digits as its factorization.
49015469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 38.
The square root of 49015469 is about 7001.1048413804. The cubic root of 49015469 is about 365.9690742978.
The spelling of 49015469 in words is "forty-nine million, fifteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •