Search a number
-
+
11060556006051 = 325059324290923
BaseRepresentation
bin1010000011110011110010…
…0000110000001010100011
31110011101020011110111222100
42200330330200300022203
52422204004314143201
635305052124541443
72221045613556036
oct240747440601243
943141204414870
1011060556006051
113584834576602
1212a77399b1883
136230101153b6
142a3495bdd01d
15142a9cb39886
hexa0f3c8302a3

11060556006051 has 12 divisors (see below), whose sum is σ = 15976675115128. Its totient is φ = 7373557954944.

The previous prime is 11060556005999. The next prime is 11060556006067. The reversal of 11060556006051 is 15060065506011.

It is not a de Polignac number, because 11060556006051 - 213 = 11060555997859 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 11060556005997 and 11060556006015.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11690125 + ... + 12600798.

Almost surely, 211060556006051 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 36.

It can be divided in two parts, 1106055 and 6006051, that added together give a triangular number (7112106 = T3771).

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

Divisors: 1 3 9 50593 151779 455337 24290923 72872769 218618307 1228950667339 3686852002017 11060556006051