Search a number
-
+
10642622336237 is a prime number
BaseRepresentation
bin1001101011011110110110…
…1110010100110011101101
31101200102110122112022212102
42122313231232110303231
52343332042304224422
634345053031544445
72145622050153263
oct232675556246355
941612418468772
1010642622336237
113433568946691
12123a74082b125
135c279722bb18
1428b169d58433
15136c8badb192
hex9adedb94ced

10642622336237 has 2 divisors, whose sum is σ = 10642622336238. Its totient is φ = 10642622336236.

The previous prime is 10642622336201. The next prime is 10642622336267. The reversal of 10642622336237 is 73263322624601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8167100858596 + 2475521477641 = 2857814^2 + 1573379^2 .

It is a cyclic number.

It is not a de Polignac number, because 10642622336237 - 226 = 10642555227373 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 210642622336237 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2612736, while the sum is 47.

The spelling of 10642622336237 in words is "ten trillion, six hundred forty-two billion, six hundred twenty-two million, three hundred thirty-six thousand, two hundred thirty-seven".