Search a number
-
+
10101002113 is a prime number
BaseRepresentation
bin10010110100001000…
…10000111110000001
3222001221211001222101
421122010100332001
5131141324031423
64350151310401
7505212046516
oct113204207601
928057731871
1010101002113
114313830434
121b5a97b401
13c4c8c2137
146bb73530d
153e1bae7ad
hex25a110f81

10101002113 has 2 divisors, whose sum is σ = 10101002114. Its totient is φ = 10101002112.

The previous prime is 10101002083. The next prime is 10101002117. The reversal of 10101002113 is 31120010101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6364369729 + 3736632384 = 79777^2 + 61128^2 .

It is a cyclic number.

It is not a de Polignac number, because 10101002113 - 29 = 10101001601 is a prime.

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

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

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

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

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

Almost surely, 210101002113 is an apocalyptic number.

It is an amenable number.

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

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

10101002113 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 10101002113 its reverse (31120010101), we get a palindrome (41221012214).

The spelling of 10101002113 in words is "ten billion, one hundred one million, two thousand, one hundred thirteen".