Base | Representation |
---|---|
bin | 10100100110100001… |
… | …01101101000010110 |
3 | 1001112211101222220222 |
4 | 22103100231220112 |
5 | 140123001112200 |
6 | 5025310154342 |
7 | 541043156465 |
oct | 122320555026 |
9 | 31484358828 |
10 | 11060566550 |
11 | 47664463a0 |
12 | 21881b29b2 |
13 | 1073642447 |
14 | 76cd589dc |
15 | 44b054d85 |
hex | 29342da16 |
11060566550 has 48 divisors (see below), whose sum is σ = 22498225200. Its totient is φ = 4012108800.
The previous prime is 11060566549. The next prime is 11060566591. The reversal of 11060566550 is 5566506011.
It is a super-2 number, since 2×110605665502 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11060566550.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 200366 + ... + 249534.
It is an arithmetic number, because the mean of its divisors is an integer number (468713025).
Almost surely, 211060566550 is an apocalyptic number.
11060566550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11060566550 is an abundant number, since it is smaller than the sum of its proper divisors (11437658650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11060566550 is a wasteful number, since it uses less digits than its factorization.
11060566550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49601 (or 49596 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 11060566550 in words is "eleven billion, sixty million, five hundred sixty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •