Search a number
-
+
100001100002 = 250000550001
BaseRepresentation
bin101110100100010000…
…1111011000011100010
3100120010020201020011112
41131020201323003202
53114300240200002
6113535002343322
710140056216336
oct1351041730342
9316106636145
10100001100002
11394570175a1
121746a1bab42
139578b0632b
144ba92697c6
1529043a5852
hex174887b0e2

100001100002 has 4 divisors (see below), whose sum is σ = 150001650006. Its totient is φ = 50000550000.

The previous prime is 100001099993. The next prime is 100001100053. The reversal of 100001100002 is 200001100001.

It is a happy number.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 200001100001 = 606732965403.

It can be written as a sum of positive squares in only one way, i.e., 70427075161 + 29574024841 = 265381^2 + 171971^2 .

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

It is an unprimeable number.

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, 25000274999 + ... + 25000275002.

Almost surely, 2100001100002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 50000550003.

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

Adding to 100001100002 its reverse (200001100001), we get a palindrome (300002200003).

Subtracting 100001100002 from its reverse (200001100001), we obtain a palindrome (99999999999).

The spelling of 100001100002 in words is "one hundred billion, one million, one hundred thousand, two".

Divisors: 1 2 50000550001 100001100002