Base | Representation |
---|---|
bin | 110110101111… |
… | …0010000110100 |
3 | 1222222222210000 |
4 | 1231132100310 |
5 | 24321311102 |
6 | 2503031300 |
7 | 465632424 |
oct | 155362064 |
9 | 58888700 |
10 | 28697652 |
11 | 15220a75 |
12 | 973b530 |
13 | 5c3a279 |
14 | 3b50484 |
15 | 27bd01c |
hex | 1b5e434 |
28697652 has 60 divisors (see below), whose sum is σ = 78303456. Its totient is φ = 9147600.
The previous prime is 28697651. The next prime is 28697653. The reversal of 28697652 is 25679682.
It is an interprime number because it is at equal distance from previous prime (28697651) and next prime (28697653).
It is a junction number, because it is equal to n+sod(n) for n = 28697598 and 28697607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28697651) 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 19 ways as a sum of consecutive naturals, for example, 5527 + ... + 9377.
Almost surely, 228697652 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28697652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39151728).
28697652 is an abundant number, since it is smaller than the sum of its proper divisors (49605804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28697652 is a wasteful number, since it uses less digits than its factorization.
28697652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3890 (or 3879 counting only the distinct ones).
The product of its digits is 362880, while the sum is 45.
The square root of 28697652 is about 5357.0189471384. The cubic root of 28697652 is about 306.1602390278.
The spelling of 28697652 in words is "twenty-eight million, six hundred ninety-seven thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •