Base | Representation |
---|---|
bin | 110110101010… |
… | …0011000000000 |
3 | 1222220221020000 |
4 | 1231110120000 |
5 | 24314012102 |
6 | 2502120000 |
7 | 465403356 |
oct | 155243000 |
9 | 58827200 |
10 | 28657152 |
11 | 151a35a7 |
12 | 9720000 |
13 | 5c249c4 |
14 | 3b3d7d6 |
15 | 27b101c |
hex | 1b54600 |
28657152 has 100 divisors (see below), whose sum is σ = 85657836. Its totient is φ = 9538560.
The previous prime is 28657151. The next prime is 28657163. The reversal of 28657152 is 25175682.
It is a happy number.
28657152 is a `hidden beast` number, since 2 + 86 + 571 + 5 + 2 = 666.
It is a super-2 number, since 2×286571522 = 1642464721502208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nialpdrome in base 12.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28657151) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 41127 + ... + 41817.
Almost surely, 228657152 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 28657152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42828918).
28657152 is an abundant number, since it is smaller than the sum of its proper divisors (57000684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28657152 is an frugal number, since it uses more digits than its factorization.
28657152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 721 (or 696 counting only the distinct ones).
The product of its digits is 33600, while the sum is 36.
The square root of 28657152 is about 5353.2375250870. The cubic root of 28657152 is about 306.0161467835.
The spelling of 28657152 in words is "twenty-eight million, six hundred fifty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •