Search a number
-
+
10168652011691 is a prime number
BaseRepresentation
bin1001001111111001001011…
…1001000001100010101011
31100000010001211202010121202
42103332102321001202223
52313100344403333231
633343225250554415
72066442450653345
oct223762271014253
940003054663552
1010168652011691
113270556a67668
121182904b98a0b
13589b90a44a94
14272245b52295
1512979b26e5cb
hex93f92e418ab

10168652011691 has 2 divisors, whose sum is σ = 10168652011692. Its totient is φ = 10168652011690.

The previous prime is 10168652011633. The next prime is 10168652011703. The reversal of 10168652011691 is 19611025686101.

10168652011691 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10168652011691 - 210 = 10168652010667 is a prime.

It is a super-4 number, since 4×101686520116914 (a number of 53 digits) contains 4444 as substring.

It is a Sophie Germain prime.

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

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

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

Almost surely, 210168652011691 is an apocalyptic number.

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

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

10168652011691 is an evil number, because the sum of its binary digits is even.

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

Adding to 10168652011691 its reverse (19611025686101), we get a palindrome (29779677697792).

The spelling of 10168652011691 in words is "ten trillion, one hundred sixty-eight billion, six hundred fifty-two million, eleven thousand, six hundred ninety-one".