Search a number
-
+
15017060131 is a prime number
BaseRepresentation
bin11011111110001011…
…00010011100100011
31102202120020200210021
431333011202130203
5221223331411011
610522043414311
71041064622263
oct157705423443
942676220707
1015017060131
1164068145a7
122ab1224397
1315542402c8
14a265c57a3
155cd584471
hex37f162723

15017060131 has 2 divisors, whose sum is σ = 15017060132. Its totient is φ = 15017060130.

The previous prime is 15017060101. The next prime is 15017060161. The reversal of 15017060131 is 13106071051.

It is a balanced prime because it is at equal distance from previous prime (15017060101) and next prime (15017060161).

It is an emirp because it is prime and its reverse (13106071051) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 15017060131 - 219 = 15016535843 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 15017060096 and 15017060105.

It is not a weakly prime, because it can be changed into another prime (15017060101) 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, 7508530065 + 7508530066.

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

Almost surely, 215017060131 is an apocalyptic number.

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

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

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

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

The spelling of 15017060131 in words is "fifteen billion, seventeen million, sixty thousand, one hundred thirty-one".