Base | Representation |
---|---|
bin | 1011101111110… |
… | …0101010111001 |
3 | 10102201010221211 |
4 | 2323330222321 |
5 | 100103110213 |
6 | 4520003121 |
7 | 1135532443 |
oct | 273745271 |
9 | 112633854 |
10 | 49269433 |
11 | 258a1944 |
12 | 146004a1 |
13 | a290a15 |
14 | 6787493 |
15 | 44d353d |
hex | 2efcab9 |
49269433 has 2 divisors, whose sum is σ = 49269434. Its totient is φ = 49269432.
The previous prime is 49269431. The next prime is 49269439. The reversal of 49269433 is 33496294.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 46949904 + 2319529 = 6852^2 + 1523^2 .
It is a cyclic number.
It is not a de Polignac number, because 49269433 - 21 = 49269431 is a prime.
Together with 49269431, it forms a pair of twin primes.
It is equal to p2959771 and since 49269433 and 2959771 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (49269431) 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, 24634716 + 24634717.
It is an arithmetic number, because the mean of its divisors is an integer number (24634717).
Almost surely, 249269433 is an apocalyptic number.
It is an amenable number.
49269433 is a deficient number, since it is larger than the sum of its proper divisors (1).
49269433 is an equidigital number, since it uses as much as digits as its factorization.
49269433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 139968, while the sum is 40.
The square root of 49269433 is about 7019.2188311806. The cubic root of 49269433 is about 366.6000513509.
The spelling of 49269433 in words is "forty-nine million, two hundred sixty-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •