Search a number
-
+
10204386422957 is a prime number
BaseRepresentation
bin1001010001111110010011…
…0100111111000010101101
31100010112022020100022102022
42110133210310333002231
52314142040411013312
633411455211235525
72102146131311366
oct224374464770255
940115266308368
1010204386422957
113284724120761
121189818448ba5
1359036716592c
14273c759d2b6d
1512a68d51d172
hex947e4d3f0ad

10204386422957 has 2 divisors, whose sum is σ = 10204386422958. Its totient is φ = 10204386422956.

The previous prime is 10204386422917. The next prime is 10204386422987. The reversal of 10204386422957 is 75922468340201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6230160768841 + 3974225654116 = 2496029^2 + 1993546^2 .

It is a cyclic number.

It is not a de Polignac number, because 10204386422957 - 212 = 10204386418861 is a prime.

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

It is a congruent number.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅10204386422957 = 20408772845914 is not.

Almost surely, 210204386422957 is an apocalyptic number.

It is an amenable number.

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

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

10204386422957 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 5806080, while the sum is 53.

The spelling of 10204386422957 in words is "ten trillion, two hundred four billion, three hundred eighty-six million, four hundred twenty-two thousand, nine hundred fifty-seven".