Base | Representation |
---|---|
bin | 100110000000010011001… |
… | …000111010100100110000 |
3 | 100020200011011100021012200 |
4 | 212000103020322210300 |
5 | 320242140233021034 |
6 | 5315440335423200 |
7 | 356454254043324 |
oct | 46002310724460 |
9 | 10220134307180 |
10 | 2611661220144 |
11 | 9176657446a9 |
12 | 3621a8084b00 |
13 | 15c3810cb232 |
14 | 90595765984 |
15 | 47e0699ba99 |
hex | 2601323a930 |
2611661220144 has 60 divisors (see below), whose sum is σ = 7309982745000. Its totient is φ = 870439560192.
The previous prime is 2611661220127. The next prime is 2611661220151. The reversal of 2611661220144 is 4410221661162.
2611661220144 is a `hidden beast` number, since 2 + 6 + 1 + 1 + 6 + 612 + 20 + 14 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 2611661220099 and 2611661220108.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 84094 + ... + 2287005.
It is an arithmetic number, because the mean of its divisors is an integer number (121833045750).
Almost surely, 22611661220144 is an apocalyptic number.
2611661220144 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
2611661220144 is an abundant number, since it is smaller than the sum of its proper divisors (4698321524856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2611661220144 is a wasteful number, since it uses less digits than its factorization.
2611661220144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2378762 (or 2378753 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The spelling of 2611661220144 in words is "two trillion, six hundred eleven billion, six hundred sixty-one million, two hundred twenty thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •