Search a number
-
+
552825000 = 233555713
BaseRepresentation
bin100000111100110…
…111000010101000
31102112020102100000
4200330313002220
52113010400000
6130504543000
716461635460
oct4074670250
91375212300
10552825000
11264067672
12135181a60
138a6bc2b0
14535c6ba0
1533800000
hex20f370a8

552825000 has 576 divisors, whose sum is σ = 2388597120. Its totient is φ = 116640000.

The previous prime is 552824983. The next prime is 552825067. The reversal of 552825000 is 528255.

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

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 143 ways as a sum of consecutive naturals, for example, 42524994 + ... + 42525006.

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

Almost surely, 2552825000 is an apocalyptic number.

552825000 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 552825000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1194298560).

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

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

552825000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 4000, while the sum is 27.

The square root of 552825000 is about 23512.2308597036. The cubic root of 552825000 is about 820.7216530328.

The spelling of 552825000 in words is "five hundred fifty-two million, eight hundred twenty-five thousand".