Search a number
-
+
1102111002002 = 2853646020517
BaseRepresentation
bin10000000010011010111…
…011110100110110010010
310220100202000021210002002
4100002122323310312102
5121024110404031002
62202145223354002
7142424223643223
oct20023273646622
93810660253062
101102111002002
11395447a2404a
1215971a8b2902
137cc0c248a9a
143b4b19b924a
151da05e8d002
hex1009aef4d92

1102111002002 has 8 divisors (see below), whose sum is σ = 1655104567116. Its totient is φ = 550409479632.

The previous prime is 1102111001993. The next prime is 1102111002007. The reversal of 1102111002002 is 2002001112011.

It can be written as a sum of positive squares in 2 ways, for example, as 1101972963001 + 138039001 = 1049749^2 + 11749^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is not an unprimeable number, because it can be changed into a prime (1102111002007) by changing a digit.

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 in 3 ways as a sum of consecutive naturals, for example, 323008553 + ... + 323011964.

Almost surely, 21102111002002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 646021372.

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

Adding to 1102111002002 its reverse (2002001112011), we get a palindrome (3104112114013).

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

Divisors: 1 2 853 1706 646020517 1292041034 551055501001 1102111002002