Base | Representation |
---|---|
bin | 110110011101… |
… | …1100111111100 |
3 | 1222201210011012 |
4 | 1230323213330 |
5 | 24302241042 |
6 | 2500014352 |
7 | 464501660 |
oct | 154734774 |
9 | 58653135 |
10 | 28555772 |
11 | 15134413 |
12 | 96913b8 |
13 | 5bba80b |
14 | 3b148a0 |
15 | 2790e82 |
hex | 1b3b9fc |
28555772 has 12 divisors (see below), whose sum is σ = 57111600. Its totient is φ = 12238176.
The previous prime is 28555771. The next prime is 28555777. The reversal of 28555772 is 27755582.
28555772 is an admirable number.
It is a super-2 number, since 2×285557722 = 1630864229031968, which contains 22 as substring.
It is a hoax number, since the sum of its digits (41) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28555771) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 509897 + ... + 509952.
It is an arithmetic number, because the mean of its divisors is an integer number (4759300).
Almost surely, 228555772 is an apocalyptic number.
It is an amenable number.
28555772 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28555772 is a wasteful number, since it uses less digits than its factorization.
28555772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019860 (or 1019858 counting only the distinct ones).
The product of its digits is 196000, while the sum is 41.
The square root of 28555772 is about 5343.7600994057. The cubic root of 28555772 is about 305.6548574118.
The spelling of 28555772 in words is "twenty-eight million, five hundred fifty-five thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •