Search a number
-
+
14103717226861 is a prime number
BaseRepresentation
bin1100110100111100011100…
…0011100010100101101101
31211221022011022011222122011
43031033013003202211231
53322033403102224421
645555054103121221
72653650155262133
oct315170703424555
954838138158564
1014103717226861
1145483977672a9
1216b948a443211
137b3c899093c2
1436a8a3075753
15196d0b6534e1
hexcd3c70e296d

14103717226861 has 2 divisors, whose sum is σ = 14103717226862. Its totient is φ = 14103717226860.

The previous prime is 14103717226777. The next prime is 14103717226871. The reversal of 14103717226861 is 16862271730141.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10333106685225 + 3770610541636 = 3214515^2 + 1941806^2 .

It is a cyclic number.

It is not a de Polignac number, because 14103717226861 - 221 = 14103715129709 is a prime.

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

It is a congruent number.

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

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

Almost surely, 214103717226861 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 677376, while the sum is 49.

The spelling of 14103717226861 in words is "fourteen trillion, one hundred three billion, seven hundred seventeen million, two hundred twenty-six thousand, eight hundred sixty-one".