Base | Representation |
---|---|
bin | 110110010011… |
… | …1111100111101 |
3 | 1222120200121221 |
4 | 1230213330331 |
5 | 24242201242 |
6 | 2454153341 |
7 | 464015032 |
oct | 154477475 |
9 | 58520557 |
10 | 28475197 |
11 | 15089923 |
12 | 9652851 |
13 | 5b8cc3a |
14 | 3ad3389 |
15 | 2777167 |
hex | 1b27f3d |
28475197 has 8 divisors (see below), whose sum is σ = 29296512. Its totient is φ = 27660000.
The previous prime is 28475191. The next prime is 28475203. The reversal of 28475197 is 79157482.
It is an interprime number because it is at equal distance from previous prime (28475191) and next prime (28475203).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 28475197 - 215 = 28442429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28475191) 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 7 ways as a sum of consecutive naturals, for example, 8908 + ... + 11674.
It is an arithmetic number, because the mean of its divisors is an integer number (3662064).
Almost surely, 228475197 is an apocalyptic number.
It is an amenable number.
28475197 is a deficient number, since it is larger than the sum of its proper divisors (821315).
28475197 is a wasteful number, since it uses less digits than its factorization.
28475197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3059.
The product of its digits is 141120, while the sum is 43.
The square root of 28475197 is about 5336.2156065886. The cubic root of 28475197 is about 305.3671007522.
It can be divided in two parts, 28475 and 197, that multiplied together give a triangular number (5609575 = T3349).
The spelling of 28475197 in words is "twenty-eight million, four hundred seventy-five thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •