Search a number
-
+
6910508326061 is a prime number
BaseRepresentation
bin110010010001111101001…
…1001001101110010101101
3220110122020012120220112002
41210203322121031302231
51401210210112413221
622410351012222045
71312160560405634
oct144437231156255
926418205526462
106910508326061
11222480388013a
1293737730a925
133b1872c15102
1419c682a5a51b
15beb58cd280b
hex648fa64dcad

6910508326061 has 2 divisors, whose sum is σ = 6910508326062. Its totient is φ = 6910508326060.

The previous prime is 6910508326027. The next prime is 6910508326067. The reversal of 6910508326061 is 1606238050196.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5405187908836 + 1505320417225 = 2324906^2 + 1226915^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-6910508326061 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 6910508325997 and 6910508326015.

It is a congruent number.

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

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

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

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

Almost surely, 26910508326061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 466560, while the sum is 47.

The spelling of 6910508326061 in words is "six trillion, nine hundred ten billion, five hundred eight million, three hundred twenty-six thousand, sixty-one".