Search a number
-
+
210100128906457 is a prime number
BaseRepresentation
bin101111110001010110111111…
…100011001111110011011001
31000112220101011020001210001201
4233301112333203033303121
5210014240031000001312
62022502400004314201
762153143024435156
oct5761267743176331
91015811136053051
10210100128906457
1160a42a67517829
121b6929900a2961
13903048484b93a
1439c4c86d6b22d
1519452be6d1557
hexbf15bf8cfcd9

210100128906457 has 2 divisors, whose sum is σ = 210100128906458. Its totient is φ = 210100128906456.

The previous prime is 210100128906377. The next prime is 210100128906463. The reversal of 210100128906457 is 754609821001012.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 209376819479881 + 723309426576 = 14469859^2 + 850476^2 .

It is a cyclic number.

It is not a de Polignac number, because 210100128906457 - 243 = 201304035884249 is a prime.

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

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

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

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

Almost surely, 2210100128906457 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 241920, while the sum is 46.

Adding to 210100128906457 its reverse (754609821001012), we get a palindrome (964709949907469).

The spelling of 210100128906457 in words is "two hundred ten trillion, one hundred billion, one hundred twenty-eight million, nine hundred six thousand, four hundred fifty-seven".