Base | Representation |
---|---|
bin | 100000110110011… |
… | …110001010000000 |
3 | 1102102002022221200 |
4 | 200312132022000 |
5 | 2112043301313 |
6 | 130405021200 |
7 | 16441461630 |
oct | 4066361200 |
9 | 1372068850 |
10 | 551150208 |
11 | 263123344 |
12 | 1346b4800 |
13 | 8a253bab |
14 | 532ac6c0 |
15 | 335bdb73 |
hex | 20d9e280 |
551150208 has 192 divisors, whose sum is σ = 1857885120. Its totient is φ = 153538560.
The previous prime is 551150203. The next prime is 551150231. The reversal of 551150208 is 802051155.
It is a tau number, because it is divible by the number of its divisors (192).
It is not an unprimeable number, because it can be changed into a prime (551150203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 329791 + ... + 331457.
It is an arithmetic number, because the mean of its divisors is an integer number (9676485).
Almost surely, 2551150208 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 551150208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (928942560).
551150208 is an abundant number, since it is smaller than the sum of its proper divisors (1306734912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
551150208 is a wasteful number, since it uses less digits than its factorization.
551150208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1735 (or 1720 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
The square root of 551150208 is about 23476.5885085546. The cubic root of 551150208 is about 819.8920183014.
The spelling of 551150208 in words is "five hundred fifty-one million, one hundred fifty thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •