Search a number
-
+
15007301506181 is a prime number
BaseRepresentation
bin1101101001100010100011…
…1000000001010010000101
31222010200110122102022202102
43122120220320001102011
53431334423141144211
651530131550121445
73106145631030455
oct332305070012205
958120418368672
1015007301506181
114866619508206
121824622ab0285
1384b24ab2cc3a
1439c5004b7d65
151b0593688a3b
hexda628e01485

15007301506181 has 2 divisors, whose sum is σ = 15007301506182. Its totient is φ = 15007301506180.

The previous prime is 15007301506177. The next prime is 15007301506189. The reversal of 15007301506181 is 18160510370051.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 14437074148225 + 570227357956 = 3799615^2 + 755134^2 .

It is a cyclic number.

It is not a de Polignac number, because 15007301506181 - 22 = 15007301506177 is a prime.

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

It is a congruent number.

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

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

Almost surely, 215007301506181 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 38.

The spelling of 15007301506181 in words is "fifteen trillion, seven billion, three hundred one million, five hundred six thousand, one hundred eighty-one".