Search a number
-
+
15408572368061 is a prime number
BaseRepresentation
bin1110000000111001011001…
…1110111000010010111101
32000120001012220100011111202
43200032112132320102331
54004423224011234221
652434333405225245
73150142534053245
oct340162636702275
960501186304452
1015408572368061
114a00814445984
12188a34b862225
1387a039843652
143b3ac9374b25
151bac2b918d0b
hexe03967b84bd

15408572368061 has 2 divisors, whose sum is σ = 15408572368062. Its totient is φ = 15408572368060.

The previous prime is 15408572368031. The next prime is 15408572368069. The reversal of 15408572368061 is 16086327580451.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14814077396836 + 594494971225 = 3848906^2 + 771035^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15408572368061 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 215408572368061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9676800, while the sum is 56.

The spelling of 15408572368061 in words is "fifteen trillion, four hundred eight billion, five hundred seventy-two million, three hundred sixty-eight thousand, sixty-one".