Search a number
-
+
50437525632 = 2731341263937
BaseRepresentation
bin101110111110010011…
…111001000010000000
311211012002002202221220
4232332103321002000
51311244001310012
635100511115040
73433613615454
oct567623710200
9154162082856
1050437525632
111a43273958a
129937512a80
1349aa5bc830
1426268a2664
1514a2ebc08c
hexbbe4f9080

50437525632 has 256 divisors, whose sum is σ = 148519768320. Its totient is φ = 15067054080.

The previous prime is 50437525553. The next prime is 50437525681. The reversal of 50437525632 is 23652573405.

It is an unprimeable number.

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 31 ways as a sum of consecutive naturals, for example, 53828268 + ... + 53829204.

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

Almost surely, 250437525632 is an apocalyptic number.

50437525632 is a gapful number since it is divisible by the number (52) 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 50437525632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74259884160).

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

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

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

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

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

The product of its (nonzero) digits is 756000, while the sum is 42.

The spelling of 50437525632 in words is "fifty billion, four hundred thirty-seven million, five hundred twenty-five thousand, six hundred thirty-two".