Search a number
-
+
100001102002 = 250000551001
BaseRepresentation
bin101110100100010000…
…1111011100010110010
3100120010020201022220121
41131020201323202302
53114300240231002
6113535002400454
710140056225224
oct1351041734262
9316106638817
10100001102002
113945701904a
121746a20012a
139578b07209
144ba926a414
1529043a6237
hex174887b8b2

100001102002 has 4 divisors (see below), whose sum is σ = 150001653006. Its totient is φ = 50000551000.

The previous prime is 100001101997. The next prime is 100001102017. The reversal of 100001102002 is 200201100001.

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

It can be written as a sum of positive squares in only one way, i.e., 60742038681 + 39259063321 = 246459^2 + 198139^2 .

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

It is an unprimeable number.

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

Almost surely, 2100001102002 is an apocalyptic number.

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

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

100001102002 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 50000551003.

The product of its (nonzero) digits is 4, while the sum is 7.

Adding to 100001102002 its reverse (200201100001), we get a palindrome (300202202003).

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

Divisors: 1 2 50000551001 100001102002