Search a number
-
+
115747194236561 is a prime number
BaseRepresentation
bin11010010100010101111110…
…011001010110111010010001
3120011211022201222102221000122
4122110111332121112322101
5110132400223211032221
61050101305454000025
733244313242506656
oct3224257631267221
9504738658387018
10115747194236561
1133976122694838
1210b946b91a6015
134c77bb51a7a04
1420822a0837c2d
15d5acb43a8eab
hex69457e656e91

115747194236561 has 2 divisors, whose sum is σ = 115747194236562. Its totient is φ = 115747194236560.

The previous prime is 115747194236503. The next prime is 115747194236567. The reversal of 115747194236561 is 165632491747511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 95467438313536 + 20279755923025 = 9770744^2 + 4503305^2 .

It is a cyclic number.

It is not a de Polignac number, because 115747194236561 - 242 = 111349147725457 is a prime.

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

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

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

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

Almost surely, 2115747194236561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 38102400, while the sum is 62.

The spelling of 115747194236561 in words is "one hundred fifteen trillion, seven hundred forty-seven billion, one hundred ninety-four million, two hundred thirty-six thousand, five hundred sixty-one".