Base | Representation |
---|---|
bin | 11001100010100000001000… |
… | …10011110001000101010100 |
3 | 21100211221112011020221120210 |
4 | 30301100010103301011110 |
5 | 24330120330022400030 |
6 | 315240011550525420 |
7 | 14554334352043446 |
oct | 1461200423610524 |
9 | 240757464227523 |
10 | 56161064653140 |
11 | 16992856976327 |
12 | 6370482b06870 |
13 | 2544c72775755 |
14 | dc22d2488496 |
15 | 675d28c87bb0 |
hex | 3314044f1154 |
56161064653140 has 96 divisors (see below), whose sum is σ = 175264251361920. Its totient is φ = 13353466761216.
The previous prime is 56161064653103. The next prime is 56161064653201. The reversal of 56161064653140 is 4135646016165.
It is a super-2 number, since 2×561610646531402 (a number of 28 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 56161064653140.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1448924497 + ... + 1448963256.
It is an arithmetic number, because the mean of its divisors is an integer number (1825669285020).
Almost surely, 256161064653140 is an apocalyptic number.
It is an amenable number.
56161064653140 is an abundant number, since it is smaller than the sum of its proper divisors (119103186708780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56161064653140 is a wasteful number, since it uses less digits than its factorization.
56161064653140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2897887801 (or 2897887799 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 48.
The spelling of 56161064653140 in words is "fifty-six trillion, one hundred sixty-one billion, sixty-four million, six hundred fifty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •