Search a number
-
+
14333015461 is a prime number
BaseRepresentation
bin11010101100101000…
…00111010110100101
31100222220002121220111
431112110013112211
5213323222443321
610330130133021
71015120423042
oct152624072645
940886077814
1014333015461
116095682726
122940121171
1314755c934b
1499d8021c9
1558d4b45e1
hex3565075a5

14333015461 has 2 divisors, whose sum is σ = 14333015462. Its totient is φ = 14333015460.

The previous prime is 14333015449. The next prime is 14333015467. The reversal of 14333015461 is 16451033341.

14333015461 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., 12567755236 + 1765260225 = 112106^2 + 42015^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 14333015461 - 25 = 14333015429 is a prime.

It is a congruent number.

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

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

Almost surely, 214333015461 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 31.

The spelling of 14333015461 in words is "fourteen billion, three hundred thirty-three million, fifteen thousand, four hundred sixty-one".