Search a number
-
+
110010112001 is a prime number
BaseRepresentation
bin110011001110100011…
…1010001100000000001
3101111221210102201102122
41212131013101200001
53300300042041001
6122312110254025
710643103344336
oct1463507214001
9344853381378
10110010112001
1142722927439
12193a21b7315
13a4b262a73a
14547869698d
152cdce43b1b
hex199d1d1801

110010112001 has 2 divisors, whose sum is σ = 110010112002. Its totient is φ = 110010112000.

The previous prime is 110010111941. The next prime is 110010112019. The reversal of 110010112001 is 100211010011.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 63604335601 + 46405776400 = 252199^2 + 215420^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 110010112001.

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

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

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

Almost surely, 2110010112001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 110010112001 its reverse (100211010011), we get a palindrome (210221122012).

The spelling of 110010112001 in words is "one hundred ten billion, ten million, one hundred twelve thousand, one".