Search a number
-
+
101010200120117 is a prime number
BaseRepresentation
bin10110111101111001000101…
…000110001100101100110101
3111020122110222112001202002022
4112331321011012030230311
5101214422342212320432
6554455240105122525
730163513631400641
oct2675710506145465
9436573875052068
10101010200120117
112a204204701302
12b3b4553789445
1344492b46c8b02
141ad2cc3bd1c21
15ba2791773b12
hex5bde4518cb35

101010200120117 has 2 divisors, whose sum is σ = 101010200120118. Its totient is φ = 101010200120116.

The previous prime is 101010200120099. The next prime is 101010200120143. The reversal of 101010200120117 is 711021002010101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 82352975121316 + 18657224998801 = 9074854^2 + 4319401^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101010200120117 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101010200120117 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28, while the sum is 17.

Adding to 101010200120117 its reverse (711021002010101), we get a palindrome (812031202130218).

The spelling of 101010200120117 in words is "one hundred one trillion, ten billion, two hundred million, one hundred twenty thousand, one hundred seventeen".