Search a number
-
+
52705202855712 = 253111723297955717
BaseRepresentation
bin10111111101111011000101…
…11001001101111100100000
320220121120100012120222010120
423332331202321031330200
523402010223412340322
6304032234055000240
714046553026330231
oct1376754271157440
9226546305528116
1052705202855712
1115880172a99020
125ab2755969080
1323541052c9c14
14d02d34387088
15615eb386ba5c
hex2fef62e4df20

52705202855712 has 768 divisors, whose sum is σ = 174691709337600. Its totient is φ = 13706456924160.

The previous prime is 52705202855663. The next prime is 52705202855717. The reversal of 52705202855712 is 21755820250725.

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

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 945916878 + ... + 945972594.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 3920000, while the sum is 51.

The spelling of 52705202855712 in words is "fifty-two trillion, seven hundred five billion, two hundred two million, eight hundred fifty-five thousand, seven hundred twelve".