Search a number
-
+
14031992413 is a prime number
BaseRepresentation
bin11010001000101111…
…10011011001011101
31100012220200001220201
431010113303121131
5212214142224123
610240214143501
71004503652605
oct150427633135
940186601821
1014031992413
115a5076a64a
122877351b91
1314281309ba
14971843c05
15571d525ad
hex3445f365d

14031992413 has 2 divisors, whose sum is σ = 14031992414. Its totient is φ = 14031992412.

The previous prime is 14031992411. The next prime is 14031992473. The reversal of 14031992413 is 31429913041.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10273444164 + 3758548249 = 101358^2 + 61307^2 .

It is an emirp because it is prime and its reverse (31429913041) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 14031992413 - 21 = 14031992411 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 214031992413 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 23328, while the sum is 37.

The spelling of 14031992413 in words is "fourteen billion, thirty-one million, nine hundred ninety-two thousand, four hundred thirteen".