Search a number
-
+
1010120100113 is a prime number
BaseRepresentation
bin11101011001011111101…
…10011000100100010001
310120120022000011202222202
432230233312120210101
5113022211221200423
62052013123212545
7132656501120045
oct16545766304421
93516260152882
101010120100113
1135a43150a9a3
12143927217155
137433bb16667
1436c66510025
151b41ee49728
hexeb2fd98911

1010120100113 has 2 divisors, whose sum is σ = 1010120100114. Its totient is φ = 1010120100112.

The previous prime is 1010120100109. The next prime is 1010120100169. The reversal of 1010120100113 is 3110010210101.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 607140172864 + 402979927249 = 779192^2 + 634807^2 .

It is a cyclic number.

It is not a de Polignac number, because 1010120100113 - 22 = 1010120100109 is a prime.

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

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

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

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

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

Almost surely, 21010120100113 is an apocalyptic number.

It is an amenable number.

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

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

1010120100113 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 11.

Adding to 1010120100113 its reverse (3110010210101), we get a palindrome (4120130310214).

The spelling of 1010120100113 in words is "one trillion, ten billion, one hundred twenty million, one hundred thousand, one hundred thirteen".