Base | Representation |
---|---|
bin | 110110101011… |
… | …0010111100011 |
3 | 1222221100102100 |
4 | 1231112113203 |
5 | 24314242230 |
6 | 2502221443 |
7 | 465436230 |
oct | 155262743 |
9 | 58840370 |
10 | 28665315 |
11 | 151a9748 |
12 | 9724883 |
13 | 5c28633 |
14 | 3b42787 |
15 | 27b3660 |
hex | 1b565e3 |
28665315 has 96 divisors (see below), whose sum is σ = 61865856. Its totient is φ = 11980800.
The previous prime is 28665313. The next prime is 28665331. The reversal of 28665315 is 51356682.
28665315 is a `hidden beast` number, since 286 + 65 + 315 = 666.
It is a Cunningham number, because it is equal to 53542-1.
It is not a de Polignac number, because 28665315 - 21 = 28665313 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 28665315.
It is not an unprimeable number, because it can be changed into a prime (28665313) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 283765 + ... + 283865.
It is an arithmetic number, because the mean of its divisors is an integer number (644436).
Almost surely, 228665315 is an apocalyptic number.
28665315 is an abundant number, since it is smaller than the sum of its proper divisors (33200541).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28665315 is a wasteful number, since it uses less digits than its factorization.
28665315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189 (or 186 counting only the distinct ones).
The product of its digits is 43200, while the sum is 36.
The square root of 28665315 is about 5353.9999066119. Note that the first 4 decimals coincide. The cubic root of 28665315 is about 306.0452002947.
The spelling of 28665315 in words is "twenty-eight million, six hundred sixty-five thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •