Search a number
-
+
111020011012 = 2297286134049
BaseRepresentation
bin110011101100101001…
…1101110111000000100
3101121120011201220102201
41213121103232320010
53304332110323022
6123000224044244
711010115344331
oct1473123567004
9347504656381
10111020011012
11430a09a1519
1219624463684
13a613922511
14553285d988
152d4b92d127
hex19d94eee04

111020011012 has 12 divisors (see below), whose sum is σ = 196287958300. Its totient is φ = 54937737216.

The previous prime is 111020011007. The next prime is 111020011033. The reversal of 111020011012 is 210110020111.

It can be written as a sum of positive squares in 2 ways, for example, as 65687639616 + 45332371396 = 256296^2 + 212914^2 .

It is a self number, because there is not a number n which added to its sum of digits gives 111020011012.

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, 143066637 + ... + 143067412.

Almost surely, 2111020011012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 111020011012 its reverse (210110020111), we get a palindrome (321130031123).

Subtracting 111020011012 from its reverse (210110020111), we obtain a palindrome (99090009099).

The spelling of 111020011012 in words is "one hundred eleven billion, twenty million, eleven thousand, twelve".

Divisors: 1 2 4 97 194 388 286134049 572268098 1144536196 27755002753 55510005506 111020011012