Base | Representation |
---|---|
bin | 110101101010… |
… | …1010001100110 |
3 | 1221221111002110 |
4 | 1223111101212 |
5 | 24200332200 |
6 | 2443021450 |
7 | 461104521 |
oct | 153252146 |
9 | 57844073 |
10 | 28136550 |
11 | 14978452 |
12 | 950a886 |
13 | 5aa1a60 |
14 | 3a45bb8 |
15 | 270bb50 |
hex | 1ad5466 |
28136550 has 96 divisors (see below), whose sum is σ = 76995072. Its totient is φ = 6756480.
The previous prime is 28136531. The next prime is 28136551. The reversal of 28136550 is 5563182.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28136551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 91497 + ... + 91803.
It is an arithmetic number, because the mean of its divisors is an integer number (802032).
Almost surely, 228136550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28136550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38497536).
28136550 is an abundant number, since it is smaller than the sum of its proper divisors (48858522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28136550 is a wasteful number, since it uses less digits than its factorization.
28136550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382 (or 377 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 28136550 is about 5304.3896915668. The cubic root of 28136550 is about 304.1517233750.
The spelling of 28136550 in words is "twenty-eight million, one hundred thirty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •