Search a number
-
+
11011022010102 = 2310118170003317
BaseRepresentation
bin1010000000111011010000…
…0011100011011011110110
31102222122101001111210201210
42200032310003203123312
52420401033113310402
635230221011302250
72214343250546502
oct240166403433366
942878331453653
1011011022010102
113565825960274
12129a014baa986
1361b447a86a1a
142a0d17335302
1514164e14506c
hexa03b40e36f6

11011022010102 has 16 divisors (see below), whose sum is σ = 22240084061232. Its totient is φ = 3634000663200.

The previous prime is 11011022010077. The next prime is 11011022010119. The reversal of 11011022010102 is 20101022011011.

It is a super-4 number, since 4×110110220101024 (a number of 53 digits) contains 4444 as substring.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 211011022010102 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 18170003423.

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

Adding to 11011022010102 its reverse (20101022011011), we get a palindrome (31112044021113).

Subtracting 11011022010102 from its reverse (20101022011011), we obtain a palindrome (9090000000909).

The spelling of 11011022010102 in words is "eleven trillion, eleven billion, twenty-two million, ten thousand, one hundred two".

Divisors: 1 2 3 6 101 202 303 606 18170003317 36340006634 54510009951 109020019902 1835170335017 3670340670034 5505511005051 11011022010102