Search a number
-
+
1100102002 = 2550051001
BaseRepresentation
bin100000110010010…
…0011100101110010
32211200000222020121
41001210203211302
54223111231002
6301055000454
736155466316
oct10144434562
92750028217
101100102002
11514a84a0a
1226850912a
13146bb823c
14a6167b46
15668a6237
hex41923972

1100102002 has 4 divisors (see below), whose sum is σ = 1650153006. Its totient is φ = 550051000.

The previous prime is 1100101997. The next prime is 1100102021. The reversal of 1100102002 is 2002010011.

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

It can be written as a sum of positive squares in only one way, i.e., 716686441 + 383415561 = 26771^2 + 19581^2 .

It is an unprimeable number.

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, 275025499 + ... + 275025502.

Almost surely, 21100102002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 550051003.

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

The square root of 1100102002 is about 33167.7856059159. The cubic root of 1100102002 is about 1032.3120219357.

Adding to 1100102002 its reverse (2002010011), we get a palindrome (3102112013).

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

Divisors: 1 2 550051001 1100102002