Base | Representation |
---|---|
bin | 11001101110010000101110… |
… | …10110110101010111100010 |
3 | 21102021120102212000122210112 |
4 | 30313020113112311113202 |
5 | 24403230321423300200 |
6 | 320145353041331322 |
7 | 14625460120435526 |
oct | 1467102726652742 |
9 | 242246385018715 |
10 | 56565111150050 |
11 | 1702914665a748 |
12 | 6416845336b42 |
13 | 25740b4535259 |
14 | dd7aa1c25d86 |
15 | 6815c5a3d535 |
hex | 3372175b55e2 |
56565111150050 has 24 divisors (see below), whose sum is σ = 105211745370000. Its totient is φ = 22625907120080.
The previous prime is 56565111149933. The next prime is 56565111150061. The reversal of 56565111150050 is 5005111156565.
It is a super-2 number, since 2×565651111500502 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5095901 + ... + 11793999.
It is an arithmetic number, because the mean of its divisors is an integer number (4383822723750).
Almost surely, 256565111150050 is an apocalyptic number.
56565111150050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56565111150050 is a deficient number, since it is larger than the sum of its proper divisors (48646634219950).
56565111150050 is a wasteful number, since it uses less digits than its factorization.
56565111150050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6867010 (or 6867005 counting only the distinct ones).
The product of its (nonzero) digits is 112500, while the sum is 41.
The spelling of 56565111150050 in words is "fifty-six trillion, five hundred sixty-five billion, one hundred eleven million, one hundred fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •