Search a number
-
+
14525404141 is a prime number
BaseRepresentation
bin11011000011100100…
…00001001111101101
31101111022002222120011
431201302001033231
5214222000413031
610401201453221
71022644620013
oct154162011755
941438088504
1014525404141
116184237136
122994641211
1314a641a0c1
149bb1a28b3
155a03186b1
hex361c813ed

14525404141 has 2 divisors, whose sum is σ = 14525404142. Its totient is φ = 14525404140.

The previous prime is 14525404139. The next prime is 14525404177. The reversal of 14525404141 is 14140452541.

14525404141 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., 8257356900 + 6268047241 = 90870^2 + 79171^2 .

It is a cyclic number.

It is not a de Polignac number, because 14525404141 - 21 = 14525404139 is a prime.

Together with 14525404139, it forms a pair of twin primes.

It is a congruent number.

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

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

Almost surely, 214525404141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 14525404141 its reverse (14140452541), we get a palindrome (28665856682).

The spelling of 14525404141 in words is "fourteen billion, five hundred twenty-five million, four hundred four thousand, one hundred forty-one".