Base | Representation |
---|---|
bin | 1010000011011101010001… |
… | …1110001111100101100000 |
3 | 1110010210122012021120210121 |
4 | 2200313110132033211200 |
5 | 2422104121440104220 |
6 | 35302212505010024 |
7 | 2220443125544446 |
oct | 240672436174540 |
9 | 43123565246717 |
10 | 11054515550560 |
11 | 3582214923a29 |
12 | 12a6532a83914 |
13 | 622589853691 |
14 | 2a308189cb96 |
15 | 1428476aeeaa |
hex | a0dd478f960 |
11054515550560 has 96 divisors (see below), whose sum is σ = 26266839604992. Its totient is φ = 4396359636480.
The previous prime is 11054515550509. The next prime is 11054515550579. The reversal of 11054515550560 is 6505551545011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33019527 + ... + 33352633.
It is an arithmetic number, because the mean of its divisors is an integer number (273612912552).
Almost surely, 211054515550560 is an apocalyptic number.
11054515550560 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 11054515550560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13133419802496).
11054515550560 is an abundant number, since it is smaller than the sum of its proper divisors (15212324054432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11054515550560 is a wasteful number, since it uses less digits than its factorization.
11054515550560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334316 (or 334308 counting only the distinct ones).
The product of its (nonzero) digits is 375000, while the sum is 43.
The spelling of 11054515550560 in words is "eleven trillion, fifty-four billion, five hundred fifteen million, five hundred fifty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •