Search a number
-
+
112002100937 is a prime number
BaseRepresentation
bin110100001001111011…
…0000110111011001001
3101201002121201020112122
41220103312012323021
53313340014212222
6123241505421025
711043342102266
oct1502366067311
9351077636478
10112002100937
11435552a2191
121985933a775
13a73c22b60c
1455c706826d
152da7c72a42
hex1a13d86ec9

112002100937 has 2 divisors, whose sum is σ = 112002100938. Its totient is φ = 112002100936.

The previous prime is 112002100897. The next prime is 112002100939. The reversal of 112002100937 is 739001200211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 61887010441 + 50115090496 = 248771^2 + 223864^2 .

It is a cyclic number.

It is not a de Polignac number, because 112002100937 - 28 = 112002100681 is a prime.

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

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

It is a Chen prime.

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

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

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

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

Almost surely, 2112002100937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 756, while the sum is 26.

The spelling of 112002100937 in words is "one hundred twelve billion, two million, one hundred thousand, nine hundred thirty-seven".