Search a number
-
+
11643695851 is a prime number
BaseRepresentation
bin10101101100000010…
…01011001011101011
31010001110200000221111
422312001023023223
5142321241231401
65203220451151
7561353532064
oct126601131353
933043600844
1011643695851
114a35621037
12230b549ab7
1311373b2078
147c658d56b
1548233de51
hex2b604b2eb

11643695851 has 2 divisors, whose sum is σ = 11643695852. Its totient is φ = 11643695850.

The previous prime is 11643695849. The next prime is 11643695857. The reversal of 11643695851 is 15859634611.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11643695851 - 21 = 11643695849 is a prime.

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

Together with 11643695849, it forms a pair of twin primes.

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

It is not a weakly prime, because it can be changed into another prime (11643695857) 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, 5821847925 + 5821847926.

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

Almost surely, 211643695851 is an apocalyptic number.

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

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

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

The product of its digits is 777600, while the sum is 49.

The spelling of 11643695851 in words is "eleven billion, six hundred forty-three million, six hundred ninety-five thousand, eight hundred fifty-one".