Base | Representation |
---|---|
bin | 110101010111… |
… | …1001011010110 |
3 | 1221122120000220 |
4 | 1222233023112 |
5 | 24130334002 |
6 | 2435415210 |
7 | 456554544 |
oct | 152571326 |
9 | 57576026 |
10 | 27980502 |
11 | 14881190 |
12 | 9454506 |
13 | 5a48a14 |
14 | 3a04d94 |
15 | 26ca7bc |
hex | 1aaf2d6 |
27980502 has 64 divisors (see below), whose sum is σ = 65629440. Its totient is φ = 7862400.
The previous prime is 27980497. The next prime is 27980503. The reversal of 27980502 is 20508972.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27980503) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66252 + ... + 66672.
It is an arithmetic number, because the mean of its divisors is an integer number (1025460).
Almost surely, 227980502 is an apocalyptic number.
27980502 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 27980502, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32814720).
27980502 is an abundant number, since it is smaller than the sum of its proper divisors (37648938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27980502 is a wasteful number, since it uses less digits than its factorization.
27980502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509.
The product of its (nonzero) digits is 10080, while the sum is 33.
The square root of 27980502 is about 5289.6599134538. The cubic root of 27980502 is about 303.5883958063.
It can be divided in two parts, 27980 and 502, that added together give a palindrome (28482).
The spelling of 27980502 in words is "twenty-seven million, nine hundred eighty thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •