Base | Representation |
---|---|
bin | 110101011010… |
… | …1001110110101 |
3 | 1221200211001101 |
4 | 1222311032311 |
5 | 24132132201 |
6 | 2440130101 |
7 | 460020052 |
oct | 152651665 |
9 | 57624041 |
10 | 28005301 |
11 | 14898885 |
12 | 9466931 |
13 | 5a570ac |
14 | 3a10029 |
15 | 26d2d01 |
hex | 1ab53b5 |
28005301 has 4 divisors (see below), whose sum is σ = 28016032. Its totient is φ = 27994572.
The previous prime is 28005269. The next prime is 28005317. The reversal of 28005301 is 10350082.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 10350082 = 2 ⋅5175041.
It is a cyclic number.
It is not a de Polignac number, because 28005301 - 25 = 28005269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28005331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1360 + ... + 7606.
It is an arithmetic number, because the mean of its divisors is an integer number (7004008).
It is a 2610-hyperperfect number.
Almost surely, 228005301 is an apocalyptic number.
It is an amenable number.
28005301 is a deficient number, since it is larger than the sum of its proper divisors (10731).
28005301 is an equidigital number, since it uses as much as digits as its factorization.
28005301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10730.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 28005301 is about 5292.0034958416. The cubic root of 28005301 is about 303.6780590238.
Adding to 28005301 its reverse (10350082), we get a palindrome (38355383).
The spelling of 28005301 in words is "twenty-eight million, five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •