Search a number
-
+
5015160151 = 10149655051
BaseRepresentation
bin1001010101110110…
…10100010101010111
3110221111220112101021
410222323110111113
540232340111101
62145352142011
7235165105111
oct45273242527
913844815337
105015160151
112143a22061
12b7b697907
1361c0390b1
143580ca3b1
151e544d5a1
hex12aed4557

5015160151 has 4 divisors (see below), whose sum is σ = 5064815304. Its totient is φ = 4965505000.

The previous prime is 5015160149. The next prime is 5015160169. The reversal of 5015160151 is 1510615105.

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 5015160151 - 21 = 5015160149 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 (5015160121) 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, 24827425 + ... + 24827626.

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

Almost surely, 25015160151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 49655152.

The product of its (nonzero) digits is 750, while the sum is 25.

The square root of 5015160151 is about 70817.7954401293. The cubic root of 5015160151 is about 1711.7024358321.

Adding to 5015160151 its reverse (1510615105), we get a palindrome (6525775256).

The spelling of 5015160151 in words is "five billion, fifteen million, one hundred sixty thousand, one hundred fifty-one".

Divisors: 1 101 49655051 5015160151