Search a number
-
+
11005100050060 = 225550255002503
BaseRepresentation
bin1010000000100101001100…
…0101000100011010001100
31102222002002100022001202101
42200021103011010122030
52420301421103100220
635223401223204444
72214043431662044
oct240112305043214
942862070261671
1011005100050060
113563267092016
121298a418a6724
1361aa12c1315c
142a0914a3c724
151414042c530a
hexa025314468c

11005100050060 has 12 divisors (see below), whose sum is σ = 23110710105168. Its totient is φ = 4402040020016.

The previous prime is 11005100050003. The next prime is 11005100050073. The reversal of 11005100050060 is 6005000150011.

It is a super-2 number, since 2×110051000500602 (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 3 ways as a sum of consecutive naturals, for example, 275127501232 + ... + 275127501271.

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

Almost surely, 211005100050060 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 150, while the sum is 19.

The spelling of 11005100050060 in words is "eleven trillion, five billion, one hundred million, fifty thousand, sixty".

Divisors: 1 2 4 5 10 20 550255002503 1100510005006 2201020010012 2751275012515 5502550025030 11005100050060