Base | Representation |
---|---|
bin | 110111000001… |
… | …1000101100111 |
3 | 2000021122200111 |
4 | 1232003011213 |
5 | 24341122422 |
6 | 2510153451 |
7 | 500131243 |
oct | 156030547 |
9 | 60248614 |
10 | 28848487 |
11 | 15314328 |
12 | 97b2887 |
13 | 5c90b15 |
14 | 3b8d423 |
15 | 27eca77 |
hex | 1b83167 |
28848487 has 4 divisors (see below), whose sum is σ = 28947240. Its totient is φ = 28749736.
The previous prime is 28848481. The next prime is 28848503. The reversal of 28848487 is 78484882.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 28848487 - 219 = 28324199 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 28848487.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28848481) 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 in 3 ways as a sum of consecutive naturals, for example, 48937 + ... + 49522.
It is an arithmetic number, because the mean of its divisors is an integer number (7236810).
Almost surely, 228848487 is an apocalyptic number.
28848487 is a deficient number, since it is larger than the sum of its proper divisors (98753).
28848487 is an equidigital number, since it uses as much as digits as its factorization.
28848487 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98752.
The product of its digits is 917504, while the sum is 49.
The square root of 28848487 is about 5371.0787557063. The cubic root of 28848487 is about 306.6956952410.
The spelling of 28848487 in words is "twenty-eight million, eight hundred forty-eight thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •