Search a number
-
+
1316565650417 is a prime number
BaseRepresentation
bin10011001010001001011…
…011011000101111110001
311122212021201112200112012
4103022021123120233301
5133032311301303132
62444453311012305
7164055503245313
oct23121133305761
94585251480465
101316565650417
11468396a94576
121931ab20a095
13971c8110554
1447a176c17b3
15243a84010b2
hex132896d8bf1

1316565650417 has 2 divisors, whose sum is σ = 1316565650418. Its totient is φ = 1316565650416.

The previous prime is 1316565650353. The next prime is 1316565650447. The reversal of 1316565650417 is 7140565656131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 947431636321 + 369134014096 = 973361^2 + 607564^2 .

It is an emirp because it is prime and its reverse (7140565656131) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1316565650417 - 26 = 1316565650353 is a prime.

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

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

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

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

Almost surely, 21316565650417 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2268000, while the sum is 50.

The spelling of 1316565650417 in words is "one trillion, three hundred sixteen billion, five hundred sixty-five million, six hundred fifty thousand, four hundred seventeen".