Search a number
-
+
10206255526013 is a prime number
BaseRepresentation
bin1001010010000101010000…
…1111000011000001111101
31100010201010111101120210102
42110201110033003001331
52314204402403313023
633412404500450445
72102243345365421
oct224412417030175
940121114346712
1010206255526013
1132854a3193528
12118a05a3a9a25
135905a446c181
14273db1d36b81
1512a74c676628
hex948543c307d

10206255526013 has 2 divisors, whose sum is σ = 10206255526014. Its totient is φ = 10206255526012.

The previous prime is 10206255526007. The next prime is 10206255526079. The reversal of 10206255526013 is 31062555260201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10187568089209 + 18687436804 = 3191797^2 + 136702^2 .

It is a cyclic number.

It is not a de Polignac number, because 10206255526013 - 222 = 10206251331709 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 210206255526013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108000, while the sum is 38.

The spelling of 10206255526013 in words is "ten trillion, two hundred six billion, two hundred fifty-five million, five hundred twenty-six thousand, thirteen".