Search a number
-
+
102006689854613 is a prime number
BaseRepresentation
bin10111001100011001001000…
…100000110111010010010101
3111101011202002121022012112212
4113030121020200313102111
5101332234200100321423
61000541120522323205
730325511603363525
oct2714311040672225
9441152077265485
10102006689854613
112a558881128825
12b5356b6059505
1344bc26067266b
141b29215d67685
15bbd664c51578
hex5cc648837495

102006689854613 has 2 divisors, whose sum is σ = 102006689854614. Its totient is φ = 102006689854612.

The previous prime is 102006689854591. The next prime is 102006689854633. The reversal of 102006689854613 is 316458986600201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100436134499089 + 1570555355524 = 10021783^2 + 1253218^2 .

It is an emirp because it is prime and its reverse (316458986600201) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 102006689854613 - 212 = 102006689850517 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2102006689854613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14929920, while the sum is 59.

The spelling of 102006689854613 in words is "one hundred two trillion, six billion, six hundred eighty-nine million, eight hundred fifty-four thousand, six hundred thirteen".