Base | Representation |
---|---|
bin | 110111000110… |
… | …0110011010001 |
3 | 2000100200021001 |
4 | 1232030303101 |
5 | 24343411043 |
6 | 2511102001 |
7 | 500355241 |
oct | 156146321 |
9 | 60320231 |
10 | 28888273 |
11 | 15341207 |
12 | 9811901 |
13 | 5ca5c6b |
14 | 3b9db21 |
15 | 280974d |
hex | 1b8ccd1 |
28888273 has 4 divisors (see below), whose sum is σ = 29049840. Its totient is φ = 28726708.
The previous prime is 28888271. The next prime is 28888283. The reversal of 28888273 is 37288882.
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 an emirpimes, since its reverse is a distinct semiprime: 37288882 = 2 ⋅18644441.
It is a cyclic number.
It is not a de Polignac number, because 28888273 - 21 = 28888271 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (28888271) 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, 80515 + ... + 80872.
It is an arithmetic number, because the mean of its divisors is an integer number (7262460).
Almost surely, 228888273 is an apocalyptic number.
It is an amenable number.
28888273 is a deficient number, since it is larger than the sum of its proper divisors (161567).
28888273 is a wasteful number, since it uses less digits than its factorization.
28888273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161566.
The product of its digits is 344064, while the sum is 46.
The square root of 28888273 is about 5374.7812048492. The cubic root of 28888273 is about 306.8366222126.
It can be divided in two parts, 28888 and 273, that added together give a triangular number (29161 = T241).
The spelling of 28888273 in words is "twenty-eight million, eight hundred eighty-eight thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •