Search a number
-
+
5041967522592 = 25371113314736011
BaseRepresentation
bin100100101011110110010…
…1011101110001100100000
3122212000012101102011111210
41021113230223232030200
51130101422141210332
614420125314110120
71030161440550330
oct111275453561440
918760171364453
105041967522592
11167431724a430
1269520087b340
132a75bc95c380
141360653970c0
158b246d02ecc
hex495ecaee320

5041967522592 has 768 divisors, whose sum is σ = 18734334345216. Its totient is φ = 1144945152000.

The previous prime is 5041967522567. The next prime is 5041967522593. The reversal of 5041967522592 is 2952257691405.

It is not an unprimeable number, because it can be changed into a prime (5041967522593) 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, 139993867 + ... + 140029877.

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

Almost surely, 25041967522592 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 13608000, while the sum is 57.

The spelling of 5041967522592 in words is "five trillion, forty-one billion, nine hundred sixty-seven million, five hundred twenty-two thousand, five hundred ninety-two".