Search a number
-
+
101020112113 is a prime number
BaseRepresentation
bin101111000010101000…
…1001001010011110001
3100122202021011101222211
41132011101021103301
53123342122041423
6114224043332121
710204241533204
oct1360521112361
9318667141884
10101020112113
113992a246468
12176b3521041
1396abc6c08b
144c6472593b
152963a9010d
hex17854494f1

101020112113 has 2 divisors, whose sum is σ = 101020112114. Its totient is φ = 101020112112.

The previous prime is 101020112111. The next prime is 101020112189. The reversal of 101020112113 is 311211020101.

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., 56231585424 + 44788526689 = 237132^2 + 211633^2 .

It is a cyclic number.

It is not a de Polignac number, because 101020112113 - 21 = 101020112111 is a prime.

Together with 101020112111, it forms a pair of twin primes.

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

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

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

Almost surely, 2101020112113 is an apocalyptic number.

It is an amenable number.

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

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

101020112113 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 13.

Adding to 101020112113 its reverse (311211020101), we get a palindrome (412231132214).

The spelling of 101020112113 in words is "one hundred one billion, twenty million, one hundred twelve thousand, one hundred thirteen".