Base | Representation |
---|---|
bin | 110101011010… |
… | …1010000111001 |
3 | 1221200211020021 |
4 | 1222311100321 |
5 | 24132133213 |
6 | 2440130441 |
7 | 460020331 |
oct | 152652071 |
9 | 57624207 |
10 | 28005433 |
11 | 14898995 |
12 | 9466a21 |
13 | 5a57181 |
14 | 3a100c1 |
15 | 26d2d8d |
hex | 1ab5439 |
28005433 has 2 divisors, whose sum is σ = 28005434. Its totient is φ = 28005432.
The previous prime is 28005407. The next prime is 28005437. The reversal of 28005433 is 33450082.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28005264 + 169 = 5292^2 + 13^2 .
It is a cyclic number.
It is not a de Polignac number, because 28005433 - 25 = 28005401 is a prime.
It is a super-3 number, since 3×280054333 (a number of 23 digits) contains 333 as substring.
It is equal to p1741750 and since 28005433 and 1741750 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 28005398 and 28005407.
It is not a weakly prime, because it can be changed into another prime (28005437) 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, 14002716 + 14002717.
It is an arithmetic number, because the mean of its divisors is an integer number (14002717).
Almost surely, 228005433 is an apocalyptic number.
It is an amenable number.
28005433 is a deficient number, since it is larger than the sum of its proper divisors (1).
28005433 is an equidigital number, since it uses as much as digits as its factorization.
28005433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 28005433 is about 5292.0159674740. The cubic root of 28005433 is about 303.6785361411.
The spelling of 28005433 in words is "twenty-eight million, five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •