Search a number
-
+
665070607213 is a prime number
BaseRepresentation
bin10011010110110010100…
…11000001101101101101
32100120122220200101200121
421223121103001231231
541344031033412323
61225310151124541
766023032613065
oct11533123015555
92316586611617
10665070607213
11237067023931
12a8a8a973751
134a93ca6829c
14242923383a5
1512477822a5d
hex9ad94c1b6d

665070607213 has 2 divisors, whose sum is σ = 665070607214. Its totient is φ = 665070607212.

The previous prime is 665070607183. The next prime is 665070607321. The reversal of 665070607213 is 312706070566.

Together with next prime (665070607321) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 643953286089 + 21117321124 = 802467^2 + 145318^2 .

It is a cyclic number.

It is not a de Polignac number, because 665070607213 - 221 = 665068510061 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 665070607213.

It is a congruent number.

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

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

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

Almost surely, 2665070607213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 317520, while the sum is 43.

Adding to 665070607213 its reverse (312706070566), we get a palindrome (977776677779).

The spelling of 665070607213 in words is "six hundred sixty-five billion, seventy million, six hundred seven thousand, two hundred thirteen".