Search a number
-
+
50688545600 = 26527112113331
BaseRepresentation
bin101111001101010001…
…011101001101000000
311211211120102220121202
4233031101131031000
51312302231424400
635141435240332
73443052346220
oct571521351500
9154746386552
1050688545600
111a5513a9600
1299a75a90a8
134a1a5cb564
14264bd66080
1514ba0534d5
hexbcd45d340

50688545600 has 504 divisors, whose sum is σ = 158544060864. Its totient is φ = 15611904000.

The previous prime is 50688545573. The next prime is 50688545603. The reversal of 50688545600 is 654588605.

It is a happy number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 153137435 + ... + 153137765.

Almost surely, 250688545600 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1152000, while the sum is 47.

The spelling of 50688545600 in words is "fifty billion, six hundred eighty-eight million, five hundred forty-five thousand, six hundred".