Base | Representation |
---|---|
bin | 110110101110… |
… | …1100001000000 |
3 | 1222222211120200 |
4 | 1231131201000 |
5 | 24321211332 |
6 | 2503005200 |
7 | 465620463 |
oct | 155354100 |
9 | 58884520 |
10 | 28694592 |
11 | 15219743 |
12 | 9739800 |
13 | 5c38a64 |
14 | 3b4d2da |
15 | 27bc17c |
hex | 1b5d840 |
28694592 has 84 divisors (see below), whose sum is σ = 84953856. Its totient is φ = 9250560.
The previous prime is 28694587. The next prime is 28694597. The reversal of 28694592 is 29549682.
It is an interprime number because it is at equal distance from previous prime (28694587) and next prime (28694597).
It is a super-2 number, since 2×286945922 = 1646759220092928, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (28694597) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17053 + ... + 18659.
Almost surely, 228694592 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 28694592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42476928).
28694592 is an abundant number, since it is smaller than the sum of its proper divisors (56259264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28694592 is a wasteful number, since it uses less digits than its factorization.
28694592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1656 (or 1643 counting only the distinct ones).
The product of its digits is 311040, while the sum is 45.
The square root of 28694592 is about 5356.7333329185. The cubic root of 28694592 is about 306.1493567945.
The spelling of 28694592 in words is "twenty-eight million, six hundred ninety-four thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •