Search a number
-
+
11006567174130 = 235111737351715077
BaseRepresentation
bin1010000000101010101010…
…0001101100111111110010
31102222012212120221200121220
42200022222201230333302
52420312422144033010
635224202552525510
72214124665222513
oct240125241547762
942865776850556
1011006567174130
11356394a258050
1212991910b0896
1361abb7b643c8
142a0a13824a0a
1514148cec8970
hexa02aa86cff2

11006567174130 has 256 divisors, whose sum is σ = 31347969698304. Its totient is φ = 2442572513280.

The previous prime is 11006567174111. The next prime is 11006567174143. The reversal of 11006567174130 is 3147176560011.

It is a super-2 number, since 2×110065671741302 (a number of 27 digits) contains 22 as substring.

It is an unprimeable number.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 730016152 + ... + 730031228.

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

Almost surely, 211006567174130 is an apocalyptic number.

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

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

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

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

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

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

The sum of its prime factors is 18669.

The product of its (nonzero) digits is 105840, while the sum is 42.

The spelling of 11006567174130 in words is "eleven trillion, six billion, five hundred sixty-seven million, one hundred seventy-four thousand, one hundred thirty".