Base | Representation |
---|---|
bin | 100000110010001… |
… | …000000100001110 |
3 | 1102022221110110100 |
4 | 200302020010032 |
5 | 2111300324100 |
6 | 130324351530 |
7 | 16426006023 |
oct | 4062100416 |
9 | 1368843410 |
10 | 550011150 |
11 | 262515577 |
12 | 1342455a6 |
13 | 89c455b0 |
14 | 5309354a |
15 | 33446400 |
hex | 20c8810e |
550011150 has 144 divisors (see below), whose sum is σ = 1604584800. Its totient is φ = 134265600.
The previous prime is 550011139. The next prime is 550011169. The reversal of 550011150 is 51110055.
550011150 is a `hidden beast` number, since 5 + 500 + 11 + 150 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 871335 + ... + 871965.
It is an arithmetic number, because the mean of its divisors is an integer number (11142950).
Almost surely, 2550011150 is an apocalyptic number.
550011150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 550011150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (802292400).
550011150 is an abundant number, since it is smaller than the sum of its proper divisors (1054573650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550011150 is a wasteful number, since it uses less digits than its factorization.
550011150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811 (or 803 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 18.
The square root of 550011150 is about 23452.3165167111. The cubic root of 550011150 is about 819.3268071888.
The spelling of 550011150 in words is "five hundred fifty million, eleven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •