Search a number
-
+
5157111151 = 29177831419
BaseRepresentation
bin1001100110110001…
…10100010101101111
3111022102000101112201
410303120310111233
541030210024101
62211422442331
7241540502323
oct46330642557
914272011481
105157111151
112207066a35
12bbb1333a7
1364257a47a
1436ccbb983
15202b3ce01
hex13363456f

5157111151 has 4 divisors (see below), whose sum is σ = 5334942600. Its totient is φ = 4979279704.

The previous prime is 5157111103. The next prime is 5157111163. The reversal of 5157111151 is 1511117515.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 5157111151 - 29 = 5157110639 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 (5157111101) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 88915681 + ... + 88915738.

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

Almost surely, 25157111151 is an apocalyptic number.

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

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

5157111151 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 177831448.

The product of its digits is 875, while the sum is 28.

The square root of 5157111151 is about 71813.0291172848. The cubic root of 5157111151 is about 1727.7019785996.

Adding to 5157111151 its reverse (1511117515), we get a palindrome (6668228666).

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

Divisors: 1 29 177831419 5157111151