Search a number
-
+
5019102816 = 253713975923
BaseRepresentation
bin1001010110010100…
…10110111001100000
3110221210022211200220
410223022112321200
540234342242231
62150012443040
7235243445550
oct45312267140
913853284626
105019102816
112146175262
12b80a79480
1361cab9830
14358835160
151e597b896
hex12b296e60

5019102816 has 192 divisors, whose sum is σ = 16385499648. Its totient is φ = 1309851648.

The previous prime is 5019102793. The next prime is 5019102839. The reversal of 5019102816 is 6182019105.

It is an interprime number because it is at equal distance from previous prime (5019102793) and next prime (5019102839).

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 25019102816 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 4320, while the sum is 33.

The square root of 5019102816 is about 70845.6266540144. The cubic root of 5019102816 is about 1712.1508696052.

The spelling of 5019102816 in words is "five billion, nineteen million, one hundred two thousand, eight hundred sixteen".