Search a number
-
+
10643334360613 is a prime number
BaseRepresentation
bin1001101011100001100000…
…1010011110111000100101
31101200111022021022220200121
42122320120022132320211
52343340022044014423
634345251425041541
72145645514235143
oct232703012367045
941614267286617
1010643334360613
1134338a3859089
12123a8bb1862b1
135c287b8bb316
1428b1d6742593
15136cce38645d
hex9ae1829ee25

10643334360613 has 2 divisors, whose sum is σ = 10643334360614. Its totient is φ = 10643334360612.

The previous prime is 10643334360587. The next prime is 10643334360643. The reversal of 10643334360613 is 31606343334601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5743034910369 + 4900299450244 = 2396463^2 + 2213662^2 .

It is a cyclic number.

It is not a de Polignac number, because 10643334360613 - 213 = 10643334352421 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10643334360613.

It is a congruent number.

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

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

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

Almost surely, 210643334360613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 839808, while the sum is 43.

The spelling of 10643334360613 in words is "ten trillion, six hundred forty-three billion, three hundred thirty-four million, three hundred sixty thousand, six hundred thirteen".