Base | Representation |
---|---|
bin | 100000110100000… |
… | …010000001000100 |
3 | 1102100212211122201 |
4 | 200310002001010 |
5 | 2111412320120 |
6 | 130343204244 |
7 | 16433156230 |
oct | 4064020104 |
9 | 1370784581 |
10 | 550510660 |
11 | 262826897 |
12 | 134446684 |
13 | 8a08ba6b |
14 | 531835c0 |
15 | 334e440a |
hex | 20d02044 |
550510660 has 96 divisors (see below), whose sum is σ = 1405313280. Its totient is φ = 176836608.
The previous prime is 550510633. The next prime is 550510669. The reversal of 550510660 is 66015055.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (550510669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 744571 + ... + 745309.
It is an arithmetic number, because the mean of its divisors is an integer number (14638680).
Almost surely, 2550510660 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 550510660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (702656640).
550510660 is an abundant number, since it is smaller than the sum of its proper divisors (854802620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550510660 is a wasteful number, since it uses less digits than its factorization.
550510660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1085 (or 1083 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 28.
The square root of 550510660 is about 23462.9635809290. The cubic root of 550510660 is about 819.5747646476.
The spelling of 550510660 in words is "five hundred fifty million, five hundred ten thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •