Search a number
-
+
14311422411371 is a prime number
BaseRepresentation
bin1101000001000010001100…
…1111111100001001101011
31212200011021122010121012122
43100100203033330021223
53333434243114130441
650234324322101455
73004652250232001
oct320204317741153
955604248117178
1014311422411371
114618492942688
1217317964aa88b
137ca73b367647
143769685daa71
1519c41628a34b
hexd04233fc26b

14311422411371 has 2 divisors, whose sum is σ = 14311422411372. Its totient is φ = 14311422411370.

The previous prime is 14311422411317. The next prime is 14311422411373. The reversal of 14311422411371 is 17311422411341.

It is a happy number.

Together with previous prime (14311422411317) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 14311422411371 - 210 = 14311422410347 is a prime.

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

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

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

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

Almost surely, 214311422411371 is an apocalyptic number.

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

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

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

The product of its digits is 16128, while the sum is 35.

The spelling of 14311422411371 in words is "fourteen trillion, three hundred eleven billion, four hundred twenty-two million, four hundred eleven thousand, three hundred seventy-one".