Base | Representation |
---|---|
bin | 110110101001… |
… | …1001110011101 |
3 | 1222220200202200 |
4 | 1231103032131 |
5 | 24313334240 |
6 | 2502042113 |
7 | 465353553 |
oct | 155231635 |
9 | 58820680 |
10 | 28652445 |
11 | 151a0008 |
12 | 9719339 |
13 | 5c22813 |
14 | 3b3bbd3 |
15 | 27ae930 |
hex | 1b5339d |
28652445 has 12 divisors (see below), whose sum is σ = 49664316. Its totient is φ = 15281280.
The previous prime is 28652443. The next prime is 28652447. The reversal of 28652445 is 54425682.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (28652443) and next prime (28652447).
It can be written as a sum of positive squares in 2 ways, for example, as 14791716 + 13860729 = 3846^2 + 3723^2 .
It is not a de Polignac number, because 28652445 - 21 = 28652443 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 congruent number.
It is not an unprimeable number, because it can be changed into a prime (28652441) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 318316 + ... + 318405.
It is an arithmetic number, because the mean of its divisors is an integer number (4138693).
Almost surely, 228652445 is an apocalyptic number.
It is an amenable number.
28652445 is a deficient number, since it is larger than the sum of its proper divisors (21011871).
28652445 is a wasteful number, since it uses less digits than its factorization.
28652445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 636732 (or 636729 counting only the distinct ones).
The product of its digits is 76800, while the sum is 36.
The square root of 28652445 is about 5352.7978665367. The cubic root of 28652445 is about 305.9993912586. Note that the first 3 decimals are identical.
The spelling of 28652445 in words is "twenty-eight million, six hundred fifty-two thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •