Search a number
-
+
5101716151 = 76124234931
BaseRepresentation
bin1001100000001011…
…00000001010110111
3111011112210000220001
410300011200022313
540422014404101
62202123252131
7240265605010
oct46005401267
914145700801
105101716151
112188870944
12ba467a047
13633c5356c
143657bc007
151ecd49901
hex1301602b7

5101716151 has 16 divisors (see below), whose sum is σ = 5929763328. Its totient is φ = 4298565600.

The previous prime is 5101716149. The next prime is 5101716157. The reversal of 5101716151 is 1516171015.

It is not a de Polignac number, because 5101716151 - 21 = 5101716149 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5101716157) by changing a digit.

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 15 ways as a sum of consecutive naturals, for example, 1032156 + ... + 1037086.

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

Almost surely, 25101716151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 7422.

The product of its (nonzero) digits is 1050, while the sum is 28.

The square root of 5101716151 is about 71426.2987351298. The cubic root of 5101716151 is about 1721.4936717395.

Adding to 5101716151 its reverse (1516171015), we get a palindrome (6617887166).

The spelling of 5101716151 in words is "five billion, one hundred one million, seven hundred sixteen thousand, one hundred fifty-one".

Divisors: 1 7 61 427 2423 4931 16961 34517 147803 300791 1034621 2105537 11947813 83634691 728816593 5101716151