Search a number
-
+
10625813595101 is a prime number
BaseRepresentation
bin1001101010100000001111…
…0110000100001111011101
31101121211002012220210210102
42122220003312010033131
52343043131240020401
634333233102150445
72144455365212135
oct232500366041735
941554065823712
1010625813595101
11342742283a691
12123742b582425
135c1018a52153
1428a413823ac5
151366060e356b
hex9aa03d843dd

10625813595101 has 2 divisors, whose sum is σ = 10625813595102. Its totient is φ = 10625813595100.

The previous prime is 10625813595049. The next prime is 10625813595119. The reversal of 10625813595101 is 10159531852601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10625813595076 + 25 = 3259726^2 + 5^2 .

It is a cyclic number.

It is not a de Polignac number, because 10625813595101 - 226 = 10625746486237 is a prime.

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

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 (10625813595191) by changing a digit.

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

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

Almost surely, 210625813595101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 324000, while the sum is 47.

The spelling of 10625813595101 in words is "ten trillion, six hundred twenty-five billion, eight hundred thirteen million, five hundred ninety-five thousand, one hundred one".