Search a number
-
+
15304119719261 is a prime number
BaseRepresentation
bin1101111010110100010010…
…0111101001010101011101
32000012001121102020211101112
43132231010213221111131
54001220314122004021
652314340542351405
73136454232150332
oct336550447512535
960161542224345
1015304119719261
11497049367093a
12187205a88b565
138702316c8c99
143aca1ac12989
151b8166845d5b
hexdeb449e955d

15304119719261 has 2 divisors, whose sum is σ = 15304119719262. Its totient is φ = 15304119719260.

The previous prime is 15304119719197. The next prime is 15304119719267. The reversal of 15304119719261 is 16291791140351.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 15282384114361 + 21735604900 = 3909269^2 + 147430^2 .

It is a cyclic number.

It is not a de Polignac number, because 15304119719261 - 26 = 15304119719197 is a prime.

It is a super-2 number, since 2×153041197192612 (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 (15304119719267) by changing a digit.

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

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

Almost surely, 215304119719261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 408240, while the sum is 50.

The spelling of 15304119719261 in words is "fifteen trillion, three hundred four billion, one hundred nineteen million, seven hundred nineteen thousand, two hundred sixty-one".