Search a number
-
+
13560482868397 is a prime number
BaseRepresentation
bin1100010101010100101111…
…0000111010110010101101
31210000100222100220022011221
43011111023300322302231
53234133332103242042
644501333321343341
72566466256361243
oct305251360726255
953010870808157
1013560482868397
114358a72070443
121630142337b51
137749955ca7ca
1434c48bcb4793
15187b150eed67
hexc554bc3acad

13560482868397 has 2 divisors, whose sum is σ = 13560482868398. Its totient is φ = 13560482868396.

The previous prime is 13560482868349. The next prime is 13560482868461. The reversal of 13560482868397 is 79386828406531.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12448837380681 + 1111645487716 = 3528291^2 + 1054346^2 .

It is a cyclic number.

It is not a de Polignac number, because 13560482868397 - 231 = 13558335384749 is a prime.

It is a congruent number.

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅13560482868397 = 27120965736794 is not.

Almost surely, 213560482868397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 418037760, while the sum is 70.

The spelling of 13560482868397 in words is "thirteen trillion, five hundred sixty billion, four hundred eighty-two million, eight hundred sixty-eight thousand, three hundred ninety-seven".