Search a number
-
+
115476633569441 is a prime number
BaseRepresentation
bin11010010000011001111111…
…101110010100100010100001
3120010212110101010210221221202
4122100121333232110202201
5110113432121143210231
61045333122203530545
733215624426003204
oct3220317756244241
9503773333727852
10115476633569441
11338814021a9011
1210b5018ab29a55
134c58527537601
1420731554b593b
15d53c2b4c55cb
hex69067fb948a1

115476633569441 has 2 divisors, whose sum is σ = 115476633569442. Its totient is φ = 115476633569440.

The previous prime is 115476633569417. The next prime is 115476633569443. The reversal of 115476633569441 is 144965336674511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97537351210000 + 17939282359441 = 9876100^2 + 4235479^2 .

It is a cyclic number.

It is not a de Polignac number, because 115476633569441 - 218 = 115476633307297 is a prime.

Together with 115476633569443, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 2115476633569441 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 195955200, while the sum is 65.

The spelling of 115476633569441 in words is "one hundred fifteen trillion, four hundred seventy-six billion, six hundred thirty-three million, five hundred sixty-nine thousand, four hundred forty-one".