Search a number
-
+
5171966592 = 2731319311759
BaseRepresentation
bin1001101000100010…
…11111001010000000
3111100102222010101020
410310101133022000
541043010412332
62213113105440
7242110663542
oct46421371200
914312863336
105171966592
112214493061
1210040b8280
1364567c080
14370c67692
152040c482c
hex13445f280

5171966592 has 256 divisors, whose sum is σ = 16084992000. Its totient is φ = 1458155520.

The previous prime is 5171966563. The next prime is 5171966629. The reversal of 5171966592 is 2956691715.

It is an unprimeable number.

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

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

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

Almost surely, 25171966592 is an apocalyptic number.

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

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

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

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

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

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

The product of its digits is 1020600, while the sum is 51.

The square root of 5171966592 is about 71916.3861161001. The cubic root of 5171966592 is about 1729.3593128038.

The spelling of 5171966592 in words is "five billion, one hundred seventy-one million, nine hundred sixty-six thousand, five hundred ninety-two".