Base | Representation |
---|---|
bin | 110110100011… |
… | …1001000100000 |
3 | 1222211011211010 |
4 | 1231013020200 |
5 | 24310243122 |
6 | 2501020520 |
7 | 465056262 |
oct | 155071040 |
9 | 58734733 |
10 | 28602912 |
11 | 15166878 |
12 | 96b4740 |
13 | 5c06100 |
14 | 3b27b32 |
15 | 279ee0c |
hex | 1b47220 |
28602912 has 144 divisors (see below), whose sum is σ = 85222368. Its totient is φ = 8386560.
The previous prime is 28602911. The next prime is 28602913. The reversal of 28602912 is 21920682.
It is an interprime number because it is at equal distance from previous prime (28602911) and next prime (28602913).
It is a self number, because there is not a number n which added to its sum of digits gives 28602912.
It is not an unprimeable number, because it can be changed into a prime (28602911) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 665163 + ... + 665205.
It is an arithmetic number, because the mean of its divisors is an integer number (591822).
Almost surely, 228602912 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 28602912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42611184).
28602912 is an abundant number, since it is smaller than the sum of its proper divisors (56619456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28602912 is a wasteful number, since it uses less digits than its factorization.
28602912 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 30.
The square root of 28602912 is about 5348.1690324821. The cubic root of 28602912 is about 305.8229570948.
The spelling of 28602912 in words is "twenty-eight million, six hundred two thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •