Search a number
-
+
10601986691 is a prime number
BaseRepresentation
bin10011101111110110…
…10111101010000011
31000100212111201121202
421313323113222003
5133203102033231
64512005211415
7523504254122
oct116773275203
930325451552
1010601986691
1145505aa57a
12207a700b6b
13ccc63040a
147280a5ab9
15420b6e5cb
hex277ed7a83

10601986691 has 2 divisors, whose sum is σ = 10601986692. Its totient is φ = 10601986690.

The previous prime is 10601986667. The next prime is 10601986693. The reversal of 10601986691 is 19668910601.

It is a strong prime.

It is an emirp because it is prime and its reverse (19668910601) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 16998610901 and 10901689961.

It is a cyclic number.

It is not a de Polignac number, because 10601986691 - 230 = 9528244867 is a prime.

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

Together with 10601986693, 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 (10601986693) by changing a digit.

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

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

Almost surely, 210601986691 is an apocalyptic number.

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

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

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

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

The spelling of 10601986691 in words is "ten billion, six hundred one million, nine hundred eighty-six thousand, six hundred ninety-one".