Search a number
-
+
10550605501111 = 131217666873491
BaseRepresentation
bin1001100110001000000100…
…0101111101001010110111
31101100121221211121210001211
42121202001011331022313
52340330120002013421
634234514203502251
72136153561030034
oct231420105751267
941317854553054
1010550605501111
1133a853982a505
121224940527987
135b6bc16197a0
1428691b25c38b
151346a36739e1
hex9988117d2b7

10550605501111 has 8 divisors (see below), whose sum is σ = 11371526785584. Its totient is φ = 9731017966080.

The previous prime is 10550605501103. The next prime is 10550605501193. The reversal of 10550605501111 is 11110550605501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10550605501111 - 23 = 10550605501103 is a prime.

It is a super-3 number, since 3×105506055011113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 333420925 + ... + 333452566.

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

Almost surely, 210550605501111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 666874721.

The product of its (nonzero) digits is 3750, while the sum is 31.

The spelling of 10550605501111 in words is "ten trillion, five hundred fifty billion, six hundred five million, five hundred one thousand, one hundred eleven".

Divisors: 1 13 1217 15821 666873491 8669355383 811585038547 10550605501111