Search a number
-
+
210144201221401 is a prime number
BaseRepresentation
bin101111110010000000000010…
…011101110010010100011001
31000120001120220200220100110121
4233302000002131302110121
5210021000311003041101
62022534525135113241
762156263131100246
oct5762000235622431
91016046820810417
10210144201221401
1160a5a723161307
121b69b42b972821
1390346894c1cc5
1439c70683145cd
1519464ed9750a1
hexbf2002772519

210144201221401 has 2 divisors, whose sum is σ = 210144201221402. Its totient is φ = 210144201221400.

The previous prime is 210144201221377. The next prime is 210144201221477. The reversal of 210144201221401 is 104122102441012.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 190157480857600 + 19986720363801 = 13789760^2 + 4470651^2 .

It is a cyclic number.

It is not a de Polignac number, because 210144201221401 - 211 = 210144201219353 is a prime.

It is a super-3 number, since 3×2101442012214013 (a number of 44 digits) contains 333 as substring.

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

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

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

Almost surely, 2210144201221401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1024, while the sum is 25.

Adding to 210144201221401 its reverse (104122102441012), we get a palindrome (314266303662413).

The spelling of 210144201221401 in words is "two hundred ten trillion, one hundred forty-four billion, two hundred one million, two hundred twenty-one thousand, four hundred one".