Search a number
-
+
1101120220012 = 22416714147683
BaseRepresentation
bin10000000001011111111…
…000010010101101101100
310220021011221221211200211
4100001133320102231230
5121020043234020022
62201503031432204
7142360533304051
oct20013770225554
93807157854624
101101120220012
11394a8972695a
121594a2b25664
137cab1bb8557
143b41a18b028
151d998ecce77
hex1005fe12b6c

1101120220012 has 12 divisors (see below), whose sum is σ = 1973959419096. Its totient is φ = 537131814560.

The previous prime is 1101120219961. The next prime is 1101120220021. The reversal of 1101120220012 is 2100220211011.

It is a junction number, because it is equal to n+sod(n) for n = 1101120219974 and 1101120220001.

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

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

Almost surely, 21101120220012 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6714147728 (or 6714147726 counting only the distinct ones).

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 1101120220012 its reverse (2100220211011), we get a palindrome (3201340431023).

Subtracting 1101120220012 from its reverse (2100220211011), we obtain a palindrome (999099990999).

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

Divisors: 1 2 4 41 82 164 6714147683 13428295366 26856590732 275280055003 550560110006 1101120220012