Search a number
-
+
210101220271 is a prime number
BaseRepresentation
bin1100001110101100000…
…0100011001110101111
3202002022022111211201201
43003223000203032233
511420241403022041
6240304050150331
721115334622535
oct3035300431657
9662268454651
10210101220271
1181115730528
12348765823a7
1316a73c896a7
14a251872155
1556ea178631
hex30eb0233af

210101220271 has 2 divisors, whose sum is σ = 210101220272. Its totient is φ = 210101220270.

The previous prime is 210101220269. The next prime is 210101220323. The reversal of 210101220271 is 172022101012.

210101220271 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 210101220271 - 21 = 210101220269 is a prime.

It is a super-2 number, since 2×2101012202712 (a number of 23 digits) contains 22 as substring.

Together with 210101220269, it forms a pair of twin primes.

It is a congruent number.

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

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

Almost surely, 2210101220271 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 112, while the sum is 19.

Adding to 210101220271 its reverse (172022101012), we get a palindrome (382123321283).

The spelling of 210101220271 in words is "two hundred ten billion, one hundred one million, two hundred twenty thousand, two hundred seventy-one".