Search a number
-
+
566725152 = 25372337991
BaseRepresentation
bin100001110001111…
…000101000100000
31110111101121202110
4201301320220200
52130040201102
6132122515320
720021040630
oct4161705040
91414347673
10566725152
112709a0aa4
12139965b40
1390548136
14553a46c0
1534b4886c
hex21c78a20

566725152 has 192 divisors, whose sum is σ = 1823883264. Its totient is φ = 150543360.

The previous prime is 566725151. The next prime is 566725157. The reversal of 566725152 is 251527665.

It is a self number, because there is not a number n which added to its sum of digits gives 566725152.

It is not an unprimeable number, because it can be changed into a prime (566725151) 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 31 ways as a sum of consecutive naturals, for example, 571377 + ... + 572367.

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

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

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

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

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

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

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

The product of its digits is 126000, while the sum is 39.

The square root of 566725152 is about 23805.9898344933. The cubic root of 566725152 is about 827.5434950045.

The spelling of 566725152 in words is "five hundred sixty-six million, seven hundred twenty-five thousand, one hundred fifty-two".