Search a number
-
+
10211008121 is a prime number
BaseRepresentation
bin10011000001001111…
…11001111001111001
3222100121210221211222
421200213321321321
5131403004224441
64405121201425
7511016064656
oct114047717171
928317727758
1010211008121
11436a936596
121b8b790275
13c6962a152
146cc1acc2d
153eb68dd4b
hex2609f9e79

10211008121 has 2 divisors, whose sum is σ = 10211008122. Its totient is φ = 10211008120.

The previous prime is 10211008117. The next prime is 10211008151. The reversal of 10211008121 is 12180011201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9889308025 + 321700096 = 99445^2 + 17936^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10211008121 - 22 = 10211008117 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 10211008121.

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

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

Almost surely, 210211008121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 32, while the sum is 17.

Adding to 10211008121 its reverse (12180011201), we get a palindrome (22391019322).

The spelling of 10211008121 in words is "ten billion, two hundred eleven million, eight thousand, one hundred twenty-one".