Search a number
-
+
10206426060143 is a prime number
BaseRepresentation
bin1001010010000101111001…
…1001100101010101101111
31100010201120101021121122022
42110201132121211111233
52314210230032411033
633412433431540355
72102250516040445
oct224413631452557
940121511247568
1010206426060143
113285580480325
12118a0a752a6bb
135906008aa641
14273dca848b95
1512a75c610098
hex9485e66556f

10206426060143 has 2 divisors, whose sum is σ = 10206426060144. Its totient is φ = 10206426060142.

The previous prime is 10206426060109. The next prime is 10206426060161. The reversal of 10206426060143 is 34106062460201.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 10206426060143 - 218 = 10206425797999 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 210206426060143 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 41472, while the sum is 35.

The spelling of 10206426060143 in words is "ten trillion, two hundred six billion, four hundred twenty-six million, sixty thousand, one hundred forty-three".