Search a number
-
+
14215050329 is a prime number
BaseRepresentation
bin11010011110100100…
…00111010001011001
31100200200010101011112
431033102013101121
5213103023102304
610310313510105
71012155635264
oct151722072131
940620111145
1014215050329
116035030787
122908712335
1314570356ac
1498bc95cdb
15582e61b6e
hex34f487459

14215050329 has 2 divisors, whose sum is σ = 14215050330. Its totient is φ = 14215050328.

The previous prime is 14215050301. The next prime is 14215050337. The reversal of 14215050329 is 92305051241.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14151481600 + 63568729 = 118960^2 + 7973^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-14215050329 is a prime.

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

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

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

Almost surely, 214215050329 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10800, while the sum is 32.

The spelling of 14215050329 in words is "fourteen billion, two hundred fifteen million, fifty thousand, three hundred twenty-nine".