Search a number
-
+
5001510769 is a prime number
BaseRepresentation
bin1001010100001110…
…01111111101110001
3110220120020001221121
410222013033331301
540220341321034
62144143422241
7234641066023
oct45207177561
913816201847
105001510769
11213724a082
12b76bb4981
1361926a438
14356376013
151e41541b4
hex12a1cff71

5001510769 has 2 divisors, whose sum is σ = 5001510770. Its totient is φ = 5001510768.

The previous prime is 5001510763. The next prime is 5001510817. The reversal of 5001510769 is 9670151005.

5001510769 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3249000000 + 1752510769 = 57000^2 + 41863^2 .

It is a cyclic number.

It is not a de Polignac number, because 5001510769 - 27 = 5001510641 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (5001510763) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2500755384 + 2500755385.

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

Almost surely, 25001510769 is an apocalyptic number.

It is an amenable number.

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

5001510769 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 9450, while the sum is 34.

The square root of 5001510769 is about 70721.3600618653. The cubic root of 5001510769 is about 1710.1481545768.

The spelling of 5001510769 in words is "five billion, one million, five hundred ten thousand, seven hundred sixty-nine".