Base | Representation |
---|---|
bin | 11001011110001000101110… |
… | …10111010110101111100000 |
3 | 21100022121100002222201022110 |
4 | 30233010113113112233200 |
5 | 24320141122442134233 |
6 | 315043043113235320 |
7 | 14540444202606240 |
oct | 1457042727265740 |
9 | 240277302881273 |
10 | 56011060505568 |
11 | 169351804a5033 |
12 | 634739aa02b40 |
13 | 2533a883a350c |
14 | db8d42337b20 |
15 | 671e99b39663 |
hex | 32f1175d6be0 |
56011060505568 has 96 divisors (see below), whose sum is σ = 168040280007936. Its totient is φ = 16002484098048.
The previous prime is 56011060505567. The next prime is 56011060505591. The reversal of 56011060505568 is 86550506011065.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-3 number, since 3×560110605055683 (a number of 42 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56011060505567) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14267155 + ... + 17764397.
It is an arithmetic number, because the mean of its divisors is an integer number (1750419583416).
Almost surely, 256011060505568 is an apocalyptic number.
It is an amenable number.
56011060505568 is an abundant number, since it is smaller than the sum of its proper divisors (112029219502368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56011060505568 is a wasteful number, since it uses less digits than its factorization.
56011060505568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3521096 (or 3521088 counting only the distinct ones).
The product of its (nonzero) digits is 1080000, while the sum is 48.
The spelling of 56011060505568 in words is "fifty-six trillion, eleven billion, sixty million, five hundred five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •