Search a number
-
+
11060500010510 = 2510613104216527
BaseRepresentation
bin1010000011110011100100…
…1011001001011000001110
31110011101002021002122112102
42200330321023021120032
52422203401000314020
635305042404435102
72221044333610526
oct240747113113016
943141067078472
1011060500010510
113584805a002a5
1212a77230a8a92
1362300163b042
142a348c5c4686
15142a97c78475
hexa0f392c960e

11060500010510 has 16 divisors (see below), whose sum is σ = 19910776107456. Its totient is φ = 4423783095648.

The previous prime is 11060500010477. The next prime is 11060500010533. The reversal of 11060500010510 is 1501000506011.

It is a super-2 number, since 2×110605000105102 (a number of 27 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 7 ways as a sum of consecutive naturals, for example, 52002134 + ... + 52214393.

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

Almost surely, 211060500010510 is an apocalyptic number.

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

11060500010510 is a deficient number, since it is larger than the sum of its proper divisors (8850276096946).

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

11060500010510 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 104227147.

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

Adding to 11060500010510 its reverse (1501000506011), we get a palindrome (12561500516521).

The spelling of 11060500010510 in words is "eleven trillion, sixty billion, five hundred million, ten thousand, five hundred ten".

Divisors: 1 2 5 10 10613 21226 53065 106130 104216527 208433054 521082635 1042165270 1106050001051 2212100002102 5530250005255 11060500010510