Base | Representation |
---|---|
bin | 110101111011… |
… | …1100101001000 |
3 | 1222012121211200 |
4 | 1223313211020 |
5 | 24214331224 |
6 | 2450024200 |
7 | 462231264 |
oct | 153674510 |
9 | 58177750 |
10 | 28277064 |
11 | 14a63a82 |
12 | 9578060 |
13 | 5b209ba |
14 | 3a810a4 |
15 | 27385c9 |
hex | 1af7948 |
28277064 has 24 divisors (see below), whose sum is σ = 76583910. Its totient is φ = 9425664.
The previous prime is 28277063. The next prime is 28277083. The reversal of 28277064 is 46077282.
It can be written as a sum of positive squares in only one way, i.e., 26936100 + 1340964 = 5190^2 + 1158^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28277063) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 196297 + ... + 196440.
Almost surely, 228277064 is an apocalyptic number.
28277064 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
28277064 is an abundant number, since it is smaller than the sum of its proper divisors (48306846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28277064 is a wasteful number, since it uses less digits than its factorization.
28277064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 392749 (or 392742 counting only the distinct ones).
The product of its (nonzero) digits is 37632, while the sum is 36.
The square root of 28277064 is about 5317.6182638471. The cubic root of 28277064 is about 304.6571943506.
The spelling of 28277064 in words is "twenty-eight million, two hundred seventy-seven thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •