Search a number
-
+
1020020101112 = 231103115596113
BaseRepresentation
bin11101101011111011110…
…11111000111111111000
310121111211221202221021102
432311331323320333320
5113203000121213422
62100331334430532
7133460022542525
oct16657573707770
93544757687242
101020020101112
11363651834201
1214582a802448
1375258b9090c
143752528214c
151b7ee153192
hexed7def8ff8

1020020101112 has 16 divisors (see below), whose sum is σ = 1914271647840. Its totient is φ = 509547661696.

The previous prime is 1020020101103. The next prime is 1020020101129. The reversal of 1020020101112 is 2111010200201.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57789233 + ... + 57806880.

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

Almost surely, 21020020101112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 1020020101112 its reverse (2111010200201), we get a palindrome (3131030301313).

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

Divisors: 1 2 4 8 1103 2206 4412 8824 115596113 231192226 462384452 924768904 127502512639 255005025278 510010050556 1020020101112