Search a number
-
+
211404341501 is a prime number
BaseRepresentation
bin1100010011100010101…
…1100100000011111101
3202012200010120020222222
43010320223210003331
511430424002412001
6241041240415125
721162540153023
oct3047053440375
9665603506888
10211404341501
118172426a821
1234b7aa774a5
1316c20c48242
14a336966713
15577478361b
hex3138ae40fd

211404341501 has 2 divisors, whose sum is σ = 211404341502. Its totient is φ = 211404341500.

The previous prime is 211404341437. The next prime is 211404341513. The reversal of 211404341501 is 105143404112.

211404341501 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., 145187671225 + 66216670276 = 381035^2 + 257326^2 .

It is a cyclic number.

It is not a de Polignac number, because 211404341501 - 26 = 211404341437 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2211404341501 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1920, while the sum is 26.

Adding to 211404341501 its reverse (105143404112), we get a palindrome (316547745613).

The spelling of 211404341501 in words is "two hundred eleven billion, four hundred four million, three hundred forty-one thousand, five hundred one".