Search a number
-
+
10011110120002 = 25005555060001
BaseRepresentation
bin1001000110101110010010…
…1010011001101001000010
31022110001102110212211022101
42101223210222121221002
52303010223142320002
633143012425301014
72052164432661565
oct221534452315102
938401373784271
1010011110120002
11320a762745682
12115827863476a
13578074b2aa24
1426877c8a64dc
1512562a4d5587
hex91ae4a99a42

10011110120002 has 4 divisors (see below), whose sum is σ = 15016665180006. Its totient is φ = 5005555060000.

The previous prime is 10011110119991. The next prime is 10011110120021. The reversal of 10011110120002 is 20002101111001.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 9670800063681 + 340310056321 = 3109791^2 + 583361^2 .

It is an unprimeable number.

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, 2502777529999 + ... + 2502777530002.

Almost surely, 210011110120002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5005555060003.

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

Adding to 10011110120002 its reverse (20002101111001), we get a palindrome (30013211231003).

Subtracting 10011110120002 from its reverse (20002101111001), we obtain a palindrome (9990990990999).

The spelling of 10011110120002 in words is "ten trillion, eleven billion, one hundred ten million, one hundred twenty thousand, two".

Divisors: 1 2 5005555060001 10011110120002