Search a number
-
+
10130210206637 is a prime number
BaseRepresentation
bin1001001101101001111110…
…0101001011001110101101
31022212102211202201002202012
42103122133211023032231
52311433132303103022
633313430533411005
72063612024006063
oct223323745131655
938772752632665
1010130210206637
11325621a627544
121177376a99a65
1358637574bc81
1427043a4b6033
1512879b479de2
hex9369f94b3ad

10130210206637 has 2 divisors, whose sum is σ = 10130210206638. Its totient is φ = 10130210206636.

The previous prime is 10130210206547. The next prime is 10130210206639. The reversal of 10130210206637 is 73660201203101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10066494855076 + 63715351561 = 3172774^2 + 252419^2 .

It is a cyclic number.

It is not a de Polignac number, because 10130210206637 - 234 = 10113030337453 is a prime.

Together with 10130210206639, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 210130210206637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9072, while the sum is 32.

Adding to 10130210206637 its reverse (73660201203101), we get a palindrome (83790411409738).

The spelling of 10130210206637 in words is "ten trillion, one hundred thirty billion, two hundred ten million, two hundred six thousand, six hundred thirty-seven".