Search a number
-
+
14314600001761 is a prime number
BaseRepresentation
bin1101000001001110000010…
…1001011111000011100001
31212200110111002022220202121
43100103200221133003201
53334012300100024021
650240011512544241
73005124063265633
oct320234051370341
955613432286677
1014314600001761
11461987357a344
1217323226b2081
137cab2678b047
14376b8a630a53
1519c55020d741
hexd04e0a5f0e1

14314600001761 has 2 divisors, whose sum is σ = 14314600001762. Its totient is φ = 14314600001760.

The previous prime is 14314600001711. The next prime is 14314600001797. The reversal of 14314600001761 is 16710000641341.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12218240611600 + 2096359390161 = 3495460^2 + 1447881^2 .

It is a cyclic number.

It is not a de Polignac number, because 14314600001761 - 27 = 14314600001633 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 214314600001761 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12096, while the sum is 34.

The spelling of 14314600001761 in words is "fourteen trillion, three hundred fourteen billion, six hundred million, one thousand, seven hundred sixty-one".