Base | Representation |
---|---|
bin | 110110101100… |
… | …0110000001001 |
3 | 1222221211211001 |
4 | 1231120300021 |
5 | 24320100311 |
6 | 2502335001 |
7 | 465506551 |
oct | 155306011 |
9 | 58854731 |
10 | 28675081 |
11 | 15206016 |
12 | 972a461 |
13 | 5c2cc06 |
14 | 3b46161 |
15 | 27b64c1 |
hex | 1b58c09 |
28675081 has 2 divisors, whose sum is σ = 28675082. Its totient is φ = 28675080.
The previous prime is 28675079. The next prime is 28675091. The reversal of 28675081 is 18057682.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19219456 + 9455625 = 4384^2 + 3075^2 .
It is a cyclic number.
It is not a de Polignac number, because 28675081 - 21 = 28675079 is a prime.
It is a super-2 number, since 2×286750812 = 1644520540713122, which contains 22 as substring.
Together with 28675079, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 28675081.
It is not a weakly prime, because it can be changed into another prime (28675091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14337540 + 14337541.
It is an arithmetic number, because the mean of its divisors is an integer number (14337541).
Almost surely, 228675081 is an apocalyptic number.
It is an amenable number.
28675081 is a deficient number, since it is larger than the sum of its proper divisors (1).
28675081 is an equidigital number, since it uses as much as digits as its factorization.
28675081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26880, while the sum is 37.
The square root of 28675081 is about 5354.9118573512. The cubic root of 28675081 is about 306.0799519108.
The spelling of 28675081 in words is "twenty-eight million, six hundred seventy-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •