Search a number
-
+
610505110001 is a prime number
BaseRepresentation
bin10001110001001001111…
…00001011000111110001
32011100211011001221021102
420320210330023013301
540000303302010001
61144243455134145
762051612545613
oct10704474130761
92140734057242
10610505110001
11215a06245196
129a3a0b14355
134575519b927
142179752cdb3
1510d32252e6b
hex8e24f0b1f1

610505110001 has 2 divisors, whose sum is σ = 610505110002. Its totient is φ = 610505110000.

The previous prime is 610505109979. The next prime is 610505110003. The reversal of 610505110001 is 100011505016.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 340998770401 + 269506339600 = 583951^2 + 519140^2 .

It is a cyclic number.

It is not a de Polignac number, because 610505110001 - 210 = 610505108977 is a prime.

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

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

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (610505110003) 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, 305252555000 + 305252555001.

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

Almost surely, 2610505110001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 150, while the sum is 20.

Adding to 610505110001 its reverse (100011505016), we get a palindrome (710516615017).

The spelling of 610505110001 in words is "six hundred ten billion, five hundred five million, one hundred ten thousand, one".