Search a number
-
+
21101310001 is a prime number
BaseRepresentation
bin10011101001101111…
…000111000000110001
32000110120211121120001
4103221233013000301
5321203413410001
613405510150001
71344624114142
oct235157070061
960416747501
1021101310001
118a49159582
12410a952301
131cb38c6965
141042685ac9
158377b0001
hex4e9bc7031

21101310001 has 2 divisors, whose sum is σ = 21101310002. Its totient is φ = 21101310000.

The previous prime is 21101309987. The next prime is 21101310011. The reversal of 21101310001 is 10001310112.

It is an a-pointer prime, because the next prime (21101310011) can be obtained adding 21101310001 to its sum of digits (10).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11837440000 + 9263870001 = 108800^2 + 96249^2 .

It is a cyclic number.

It is not a de Polignac number, because 21101310001 - 215 = 21101277233 is a prime.

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

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

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

Almost surely, 221101310001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 10.

Adding to 21101310001 its reverse (10001310112), we get a palindrome (31102620113).

The spelling of 21101310001 in words is "twenty-one billion, one hundred one million, three hundred ten thousand, one".