Base | Representation |
---|---|
bin | 101001001100001000101… |
… | …0001001100010001001100 |
3 | 202001012011202202121122001 |
4 | 1102120101101030101030 |
5 | 1220222320443144000 |
6 | 20012353054002044 |
7 | 1122666155165416 |
oct | 122302121142114 |
9 | 22035152677561 |
10 | 5661056615500 |
11 | 189292796aa70 |
12 | 7751984a6324 |
13 | 320ab234c410 |
14 | 157dd49679b6 |
15 | 9c3cc95846a |
hex | 5261144c44c |
5661056615500 has 384 divisors, whose sum is σ = 14856237527040. Its totient is φ = 1857398400000.
The previous prime is 5661056615449. The next prime is 5661056615509. The reversal of 5661056615500 is 55166501665.
It is not an unprimeable number, because it can be changed into a prime (5661056615509) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 570493539 + ... + 570503461.
It is an arithmetic number, because the mean of its divisors is an integer number (38688118560).
Almost surely, 25661056615500 is an apocalyptic number.
5661056615500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5661056615500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7428118763520).
5661056615500 is an abundant number, since it is smaller than the sum of its proper divisors (9195180911540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5661056615500 is a wasteful number, since it uses less digits than its factorization.
5661056615500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10146 (or 10134 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 46.
The spelling of 5661056615500 in words is "five trillion, six hundred sixty-one billion, fifty-six million, six hundred fifteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •