Base | Representation |
---|---|
bin | 110110101100… |
… | …1111110110101 |
3 | 1222222002201120 |
4 | 1231121332311 |
5 | 24320230432 |
6 | 2502414153 |
7 | 465530334 |
oct | 155317665 |
9 | 58862646 |
10 | 28680117 |
11 | 15209884 |
12 | 9731359 |
13 | 5c322ab |
14 | 3b47d1b |
15 | 27b7c2c |
hex | 1b59fb5 |
28680117 has 4 divisors (see below), whose sum is σ = 38240160. Its totient is φ = 19120076.
The previous prime is 28680107. The next prime is 28680121. The reversal of 28680117 is 71108682.
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.
It is a cyclic number.
It is not a de Polignac number, because 28680117 - 215 = 28647349 is a prime.
It is a super-2 number, since 2×286801172 = 1645098222267378, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28680107) 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 in 3 ways as a sum of consecutive naturals, for example, 4780017 + ... + 4780022.
It is an arithmetic number, because the mean of its divisors is an integer number (9560040).
Almost surely, 228680117 is an apocalyptic number.
It is an amenable number.
28680117 is a deficient number, since it is larger than the sum of its proper divisors (9560043).
28680117 is an equidigital number, since it uses as much as digits as its factorization.
28680117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9560042.
The product of its (nonzero) digits is 5376, while the sum is 33.
The square root of 28680117 is about 5355.3820591999. The cubic root of 28680117 is about 306.0978690750.
Adding to 28680117 its reverse (71108682), we get a palindrome (99788799).
The spelling of 28680117 in words is "twenty-eight million, six hundred eighty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •