Search a number
-
+
1101102112002 = 231109091654663
BaseRepresentation
bin10000000001011110110…
…011001101110100000010
310220021010200212212011210
4100001132303031310002
5121020024120041002
62201501143350550
7142360223345034
oct20013663156402
93807120785153
101101102112002
11394a7a489062
12159498a52456
137caab218359
143b4179d5c54
151d99760296c
hex1005eccdd02

1101102112002 has 16 divisors (see below), whose sum is σ = 2202225410880. Its totient is φ = 367030506192.

The previous prime is 1101102111979. The next prime is 1101102112037. The reversal of 1101102112002 is 2002112011011.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 161878 + ... + 1492785.

It is an arithmetic number, because the mean of its divisors is an integer number (137639088180).

Almost surely, 21101102112002 is an apocalyptic number.

1101102112002 is an abundant number, since it is smaller than the sum of its proper divisors (1101123298878).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

1101102112002 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1765577.

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

Adding to 1101102112002 its reverse (2002112011011), we get a palindrome (3103214123013).

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

Divisors: 1 2 3 6 110909 221818 332727 665454 1654663 3309326 4963989 9927978 183517018667 367034037334 550551056001 1101102112002