Search a number
-
+
14119609337 is a prime number
BaseRepresentation
bin11010010011001100…
…00010001111111001
31100110000112110201222
431021212002033321
5212404104444322
610253024121425
71006616461541
oct151146021771
940400473658
1014119609337
115a96173529
1228a0766275
13144032a032
1497d330321
155798ace42
hex3499823f9

14119609337 has 2 divisors, whose sum is σ = 14119609338. Its totient is φ = 14119609336.

The previous prime is 14119609307. The next prime is 14119609373. The reversal of 14119609337 is 73390691141.

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

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12578968336 + 1540641001 = 112156^2 + 39251^2 .

It is a cyclic number.

It is not a de Polignac number, because 14119609337 - 210 = 14119608313 is a prime.

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

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

Almost surely, 214119609337 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 122472, while the sum is 44.

The spelling of 14119609337 in words is "fourteen billion, one hundred nineteen million, six hundred nine thousand, three hundred thirty-seven".