Search a number
-
+
10102010211113 is a prime number
BaseRepresentation
bin1001001100000000111010…
…1110101110101100101001
31022202202001110102220022112
42103000032232232230221
52311002404103223423
633252444401532105
72061563142003512
oct223001656565451
938682043386275
1010102010211113
113245269450517
121171a06944035
13583800278ca2
1426cd23145a09
15127b9a8aaa78
hex9300ebaeb29

10102010211113 has 2 divisors, whose sum is σ = 10102010211114. Its totient is φ = 10102010211112.

The previous prime is 10102010211079. The next prime is 10102010211121. The reversal of 10102010211113 is 31111201020101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8618381461264 + 1483628749849 = 2935708^2 + 1218043^2 .

It is a cyclic number.

It is not a de Polignac number, because 10102010211113 - 212 = 10102010207017 is a prime.

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

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

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

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

Almost surely, 210102010211113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 14.

Adding to 10102010211113 its reverse (31111201020101), we get a palindrome (41213211231214).

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