Search a number
-
+
1060550131520 = 265112532711907
BaseRepresentation
bin11110110111011011011…
…01101011111101000000
310202101110120011210210202
433123231231223331000
5114334001313202040
62131113205544332
7136423264243505
oct17335555537500
93671416153722
101060550131520
1137985a99aa00
121516601150a8
13790179b1029
143948bdc14ac
151c8c2436015
hexf6edb6bf40

1060550131520 has 336 divisors, whose sum is σ = 2840191651584. Its totient is φ = 376784179200.

The previous prime is 1060550131507. The next prime is 1060550131559. The reversal of 1060550131520 is 251310550601.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 556134407 + ... + 556136313.

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

Almost surely, 21060550131520 is an apocalyptic number.

1060550131520 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 1060550131520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1420095825792).

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

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

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 29.

The spelling of 1060550131520 in words is "one trillion, sixty billion, five hundred fifty million, one hundred thirty-one thousand, five hundred twenty".