Search a number
-
+
70086656921 is a prime number
BaseRepresentation
bin100000101000101111…
…1011000001110011001
320200220110102001211012
41001101133120032121
52122014141010141
652110344143305
75030545516511
oct1012137301631
9220813361735
1070086656921
11277a60aa766
12116bba67b35
1367bc398a38
14356c332841
151c5302bceb
hex10517d8399

70086656921 has 2 divisors, whose sum is σ = 70086656922. Its totient is φ = 70086656920.

The previous prime is 70086656897. The next prime is 70086656971. The reversal of 70086656921 is 12965668007.

It is an a-pointer prime, because the next prime (70086656971) can be obtained adding 70086656921 to its sum of digits (50).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 42989875600 + 27096781321 = 207340^2 + 164611^2 .

It is a cyclic number.

It is not a de Polignac number, because 70086656921 - 226 = 70019548057 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 270086656921 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 70086656921 in words is "seventy billion, eighty-six million, six hundred fifty-six thousand, nine hundred twenty-one".