Search a number
-
+
1101011112002 = 2550505556001
BaseRepresentation
bin10000000001011001011…
…000000101000001000010
310220020220100122120122102
4100001121120011001002
5121014332321041002
62201444133110402
7142355040015644
oct20013130050102
93806810576572
101101011112002
11394a3308444a
12159472488402
137ca954061b9
143b4098a8894
151d98e629a02
hex10059605042

1101011112002 has 4 divisors (see below), whose sum is σ = 1651516668006. Its totient is φ = 550505556000.

The previous prime is 1101011111947. The next prime is 1101011112011. The reversal of 1101011112002 is 2002111101011.

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., 760329936961 + 340681175041 = 871969^2 + 583679^2 .

It is an unprimeable number.

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

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

Almost surely, 21101011112002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 550505556003.

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

Adding to 1101011112002 its reverse (2002111101011), we get a palindrome (3103122213013).

The spelling of 1101011112002 in words is "one trillion, one hundred one billion, eleven million, one hundred twelve thousand, two".

Divisors: 1 2 550505556001 1101011112002