Search a number
-
+
10959487350257 is a prime number
BaseRepresentation
bin1001111101111011010001…
…0110011011010111110001
31102210201100111221211120102
42133132310112123113301
52414030012230202012
635150415144522145
72210540212302005
oct237366426332761
942721314854512
1010959487350257
11354598a9945a6
121290032180355
136166240aaa64
1429c628c7c705
15140134bab2c2
hex9f7b459b5f1

10959487350257 has 2 divisors, whose sum is σ = 10959487350258. Its totient is φ = 10959487350256.

The previous prime is 10959487350241. The next prime is 10959487350271. The reversal of 10959487350257 is 75205378495901.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10946675147776 + 12812202481 = 3308576^2 + 113191^2 .

It is a cyclic number.

It is not a de Polignac number, because 10959487350257 - 24 = 10959487350241 is a prime.

It is a super-2 number, since 2×109594873502572 (a number of 27 digits) contains 22 as substring.

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

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

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

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

Almost surely, 210959487350257 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 95256000, while the sum is 65.

The spelling of 10959487350257 in words is "ten trillion, nine hundred fifty-nine billion, four hundred eighty-seven million, three hundred fifty thousand, two hundred fifty-seven".