Base | Representation |
---|---|
bin | 110110101101… |
… | …0000110110001 |
3 | 1222222010102101 |
4 | 1231122012301 |
5 | 24320240000 |
6 | 2502420401 |
7 | 465531661 |
oct | 155320661 |
9 | 58863371 |
10 | 28680625 |
11 | 1520a1a6 |
12 | 9731701 |
13 | 5c325ac |
14 | 3b481a1 |
15 | 27b7e6a |
hex | 1b5a1b1 |
28680625 has 20 divisors (see below), whose sum is σ = 36254020. Its totient is φ = 22680000.
The previous prime is 28680599. The next prime is 28680629. The reversal of 28680625 is 52608682.
It can be written as a sum of positive squares in 10 ways, for example, as 26998416 + 1682209 = 5196^2 + 1297^2 .
It is not a de Polignac number, because 28680625 - 25 = 28680593 is a prime.
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (28680629) 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 19 ways as a sum of consecutive naturals, for example, 67915 + ... + 68335.
It is an arithmetic number, because the mean of its divisors is an integer number (1812701).
Almost surely, 228680625 is an apocalyptic number.
28680625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
28680625 is a deficient number, since it is larger than the sum of its proper divisors (7573395).
28680625 is an equidigital number, since it uses as much as digits as its factorization.
28680625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550 (or 535 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 37.
The square root of 28680625 is about 5355.4294879122. The cubic root of 28680625 is about 306.0996763294.
The spelling of 28680625 in words is "twenty-eight million, six hundred eighty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •