Search a number
-
+
100010112001 is a prime number
BaseRepresentation
bin101110100100100010…
…0010011010000000001
3100120010212200002022021
41131021010103100001
53114310042041001
6113535523441441
710140225632362
oct1351104232001
9316125602267
10100010112001
1139461112428
1217471226281
13957a940287
144baa533b69
152905085ba1
hex1749113401

100010112001 has 2 divisors, whose sum is σ = 100010112002. Its totient is φ = 100010112000.

The previous prime is 100010111989. The next prime is 100010112049. The reversal of 100010112001 is 100211010001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 78164976400 + 21845135601 = 279580^2 + 147801^2 .

It is a cyclic number.

It is not a de Polignac number, because 100010112001 - 25 = 100010111969 is a prime.

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

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

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

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

Almost surely, 2100010112001 is an apocalyptic number.

It is an amenable number.

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

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

100010112001 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 7.

Adding to 100010112001 its reverse (100211010001), we get a palindrome (200221122002).

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