Search a number
-
+
11121020101000 = 2353176779832
BaseRepresentation
bin1010000111010101000001…
…1100111110000110001000
31110101011022000022210022101
42201311100130332012020
52424201322121213000
635352532012203144
72225316150106165
oct241652034760610
943334260283271
1011121020101000
1135a8441a17007
1212b73b31694b4
13628927a65984
142a639017d06c
1514443aeb1e6a
hexa1d5073e188

11121020101000 has 192 divisors, whose sum is σ = 27622763279280. Its totient is φ = 4176299878400.

The previous prime is 11121020100977. The next prime is 11121020101007. The reversal of 11121020101000 is 10102012111.

It can be written as a sum of positive squares in 8 ways, for example, as 4416949535716 + 6704070565284 = 2101654^2 + 2589222^2 .

It is a super-3 number, since 3×111210201010003 (a number of 40 digits) contains 333 as substring.

It is a Harshad number since it is a multiple of its sum of digits (10).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11121020101007) by changing a digit.

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 47 ways as a sum of consecutive naturals, for example, 11313346509 + ... + 11313347491.

Almost surely, 211121020101000 is an apocalyptic number.

11121020101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 11121020101000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13811381639640).

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

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

11121020101000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 11121020101000 its reverse (10102012111), we get a palindrome (11131122113111).

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