Search a number
-
+
5111016509 = 397103112487
BaseRepresentation
bin1001100001010001…
…11110110000111101
3111012012021112120202
410300220332300331
540431410012014
62203054453245
7240440631524
oct46050766075
914165245522
105111016509
112193043395
12ba7804225
13635b5b831
14366b1d4bb
151eda853de
hex130a3ec3d

5111016509 has 8 divisors (see below), whose sum is σ = 5129271168. Its totient is φ = 5092789680.

The previous prime is 5111016503. The next prime is 5111016539. The reversal of 5111016509 is 9056101115.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-5111016509 is a prime.

It is a super-2 number, since 2×51110165092 = 52244979510541094162, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5111016503) 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 7 ways as a sum of consecutive naturals, for example, 403064 + ... + 415550.

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

Almost surely, 25111016509 is an apocalyptic number.

It is an amenable number.

5111016509 is a deficient number, since it is larger than the sum of its proper divisors (18254659).

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

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

The sum of its prime factors is 13915.

The product of its (nonzero) digits is 1350, while the sum is 29.

The square root of 5111016509 is about 71491.3736684364. The cubic root of 5111016509 is about 1722.5391231021.

The spelling of 5111016509 in words is "five billion, one hundred eleven million, sixteen thousand, five hundred nine".

Divisors: 1 397 1031 12487 409307 4957339 12874097 5111016509