Search a number
-
+
14330106929 is a prime number
BaseRepresentation
bin11010101100010010…
…00001010000110001
31100222200121212011002
431112021001100301
5213322001410204
610325543531345
71015053620255
oct152611012061
940880555132
1014330106929
116093a76486
12293b159b55
131474b1b518
1499d286265
1558d0dc91e
hex356241431

14330106929 has 2 divisors, whose sum is σ = 14330106930. Its totient is φ = 14330106928.

The previous prime is 14330106913. The next prime is 14330106941. The reversal of 14330106929 is 92960103341.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14240842225 + 89264704 = 119335^2 + 9448^2 .

It is a cyclic number.

It is not a de Polignac number, because 14330106929 - 24 = 14330106913 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 14330106892 and 14330106901.

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

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

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

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

Almost surely, 214330106929 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 34992, while the sum is 38.

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