Search a number
-
+
561722956032 = 2837478924979
BaseRepresentation
bin10000010110010010100…
…11000001100100000000
31222200220102211202100010
420023021103001210000
533200402034043112
61110015120224520
755404006226440
oct10131123014400
91880812752303
10561722956032
111a7252a67967
1290a47a6b140
1340c7c831274
141d28a856120
15e92977163c
hex82c94c1900

561722956032 has 288 divisors, whose sum is σ = 1764603187200. Its totient is φ = 155306409984.

The previous prime is 561722956031. The next prime is 561722956061. The reversal of 561722956032 is 230659227165.

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

It is not an unprimeable number, because it can be changed into a prime (561722956031) by changing a digit.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22475319 + ... + 22500297.

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

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

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

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

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

561722956032 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 1360800, while the sum is 48.

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