Search a number
-
+
10110202021 is a prime number
BaseRepresentation
bin10010110101001110…
…10111000010100101
3222002121010110212201
421122213113002211
5131201202431041
64351120414501
7505353204433
oct113247270245
928077113781
1010110202021
114318a44467
121b61a77431
13c5179377a
146bca4bd53
153e28ca631
hex25a9d70a5

10110202021 has 2 divisors, whose sum is σ = 10110202022. Its totient is φ = 10110202020.

The previous prime is 10110202009. The next prime is 10110202061. The reversal of 10110202021 is 12020201101.

10110202021 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 can be written as a sum of positive squares in only one way, i.e., 8270993025 + 1839208996 = 90945^2 + 42886^2 .

It is a cyclic number.

It is not a de Polignac number, because 10110202021 - 29 = 10110201509 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10110201989 and 10110202007.

It is a congruent number.

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

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

Almost surely, 210110202021 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 10110202021 its reverse (12020201101), we get a palindrome (22130403122).

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