[go: up one dir, main page]

Search a number
-
+
5141510981 is a prime number
BaseRepresentation
bin1001100100111010…
…10011101101000101
3111021022122211010122
410302131103231011
541012211322411
62210104231325
7241261056635
oct46235235505
914238584118
105141510981
1121a9281332
12bb5a6b545
1363c2778b9
1436abba6c5
152015aa9db
hex132753b45

5141510981 has 2 divisors, whose sum is σ = 5141510982. Its totient is φ = 5141510980.

The previous prime is 5141510971. The next prime is 5141511013. The reversal of 5141510981 is 1890151415.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4336881025 + 804629956 = 65855^2 + 28366^2 .

It is a cyclic number.

It is not a de Polignac number, because 5141510981 - 26 = 5141510917 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (5141510911) 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 as a sum of consecutive naturals, namely, 2570755490 + 2570755491.

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

Almost surely, 25141510981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7200, while the sum is 35.

The square root of 5141510981 is about 71704.3302806741. The cubic root of 5141510981 is about 1725.9581297380.

The spelling of 5141510981 in words is "five billion, one hundred forty-one million, five hundred ten thousand, nine hundred eighty-one".