Base | Representation |
---|---|
bin | 101000110000011100110… |
… | …1101011010111011110100 |
3 | 201211111201112010012001101 |
4 | 1101200321231122323310 |
5 | 1213234042010441400 |
6 | 15525201515335444 |
7 | 1115463002444212 |
oct | 121407155327364 |
9 | 21744645105041 |
10 | 5601605562100 |
11 | 186a69a340689 |
12 | 765766451584 |
13 | 3182c9554102 |
14 | 155194d6bcb2 |
15 | 9aa9d4db56a |
hex | 51839b5aef4 |
5601605562100 has 36 divisors (see below), whose sum is σ = 12158988853900. Its totient is φ = 2239996181760.
The previous prime is 5601605562097. The next prime is 5601605562139. The reversal of 5601605562100 is 12655061065.
It can be written as a sum of positive squares in 6 ways, for example, as 108263373156 + 5493342188944 = 329034^2 + 2343788^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 5601605562100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7726905 + ... + 8420704.
Almost surely, 25601605562100 is an apocalyptic number.
5601605562100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5601605562100 is an abundant number, since it is smaller than the sum of its proper divisors (6557383291800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5601605562100 is a wasteful number, since it uses less digits than its factorization.
5601605562100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16151092 (or 16151085 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 5601605562100 in words is "five trillion, six hundred one billion, six hundred five million, five hundred sixty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •