Base | Representation |
---|---|
bin | 101001001110000011000… |
… | …1011010111011000001000 |
3 | 202001120210010100212211202 |
4 | 1102130012023113120020 |
5 | 1220304224332143211 |
6 | 20014312513443332 |
7 | 1123203040163240 |
oct | 122340613273010 |
9 | 22046703325752 |
10 | 5665165506056 |
11 | 1894646268291 |
12 | 775b44570548 |
13 | 3212b86a81c4 |
14 | 1582a4544b20 |
15 | 9c56d53c53b |
hex | 527062d7608 |
5665165506056 has 64 divisors (see below), whose sum is σ = 12854517264000. Its totient is φ = 2284970038272.
The previous prime is 5665165506047. The next prime is 5665165506083. The reversal of 5665165506056 is 6506055615665.
It is a super-2 number, since 2×56651655060562 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a junction number, because it is equal to n+sod(n) for n = 5665165505992 and 5665165506010.
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, 16296650 + ... + 16640646.
It is an arithmetic number, because the mean of its divisors is an integer number (200851832250).
Almost surely, 25665165506056 is an apocalyptic number.
5665165506056 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
5665165506056 is an abundant number, since it is smaller than the sum of its proper divisors (7189351757944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5665165506056 is a wasteful number, since it uses less digits than its factorization.
5665165506056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 361326 (or 361322 counting only the distinct ones).
The product of its (nonzero) digits is 24300000, while the sum is 56.
The spelling of 5665165506056 in words is "five trillion, six hundred sixty-five billion, one hundred sixty-five million, five hundred six thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •