Search a number
-
+
15110270137 is a prime number
BaseRepresentation
bin11100001001010010…
…00110110010111001
31110000001122020212201
432010221012302321
5221421212121022
610535213310201
71043306114464
oct160451066271
943001566781
1015110270137
116454398666
122b18495361
13156a647361
14a34b2a2db
155d6847127
hex384a46cb9

15110270137 has 2 divisors, whose sum is σ = 15110270138. Its totient is φ = 15110270136.

The previous prime is 15110270129. The next prime is 15110270159. The reversal of 15110270137 is 73107201151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10829316096 + 4280954041 = 104064^2 + 65429^2 .

It is a cyclic number.

It is not a de Polignac number, because 15110270137 - 23 = 15110270129 is a prime.

It is a super-2 number, since 2×151102701372 (a number of 21 digits) contains 22 as substring.

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

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

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

Almost surely, 215110270137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 15110270137 its reverse (73107201151), we get a palindrome (88217471288).

The spelling of 15110270137 in words is "fifteen billion, one hundred ten million, two hundred seventy thousand, one hundred thirty-seven".