Search a number
-
+
551775000 = 2335571051
BaseRepresentation
bin100000111000110…
…110101100011000
31102110021002000010
4200320312230120
52112223300000
6130430241520
716450003320
oct4070665430
91373232003
10551775000
1126350a7a7
121349562a0
138a4123aa
14533d2280
1533693d50
hex20e36b18

551775000 has 192 divisors, whose sum is σ = 1972373760. Its totient is φ = 126000000.

The previous prime is 551774999. The next prime is 551775031. The reversal of 551775000 is 577155.

It is a Harshad number since it is a multiple of its sum of digits (30).

It is a congruent number.

It is an unprimeable number.

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, 524475 + ... + 525525.

It is an arithmetic number, because the mean of its divisors is an integer number (10272780).

Almost surely, 2551775000 is an apocalyptic number.

551775000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 551775000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (986186880).

551775000 is an abundant number, since it is smaller than the sum of its proper divisors (1420598760).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

551775000 is a wasteful number, since it uses less digits than its factorization.

551775000 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1092 (or 1068 counting only the distinct ones).

The product of its (nonzero) digits is 6125, while the sum is 30.

The square root of 551775000 is about 23489.8914429165. The cubic root of 551775000 is about 820.2017151977.

The spelling of 551775000 in words is "five hundred fifty-one million, seven hundred seventy-five thousand".