Search a number
-
+
14313465461 is a prime number
BaseRepresentation
bin11010101010010011…
…00010011001110101
31100221112022101100102
431111021202121311
5213303221343321
610324151123445
71014462310001
oct152511423165
940845271312
1014313465461
11608563a4a9
122935673585
1314715429b9
1499ad93701
1558b901c0b
hex355262675

14313465461 has 2 divisors, whose sum is σ = 14313465462. Its totient is φ = 14313465460.

The previous prime is 14313465443. The next prime is 14313465539. The reversal of 14313465461 is 16456431341.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7585364836 + 6728100625 = 87094^2 + 82025^2 .

It is a cyclic number.

It is not a de Polignac number, because 14313465461 - 214 = 14313449077 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 214313465461 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 103680, while the sum is 38.

The spelling of 14313465461 in words is "fourteen billion, three hundred thirteen million, four hundred sixty-five thousand, four hundred sixty-one".