Base | Representation |
---|---|
bin | 100110101110101000100… |
… | …101001001000100000000 |
3 | 100102102120110012211220210 |
4 | 212232220211021010000 |
5 | 322101033221034320 |
6 | 5354345234234120 |
7 | 363165203536506 |
oct | 46565045110400 |
9 | 10372513184823 |
10 | 2661413064960 |
11 | 936776324021 |
12 | 36b971a25940 |
13 | 163c7c623170 |
14 | 92b5513a676 |
15 | 493696740e0 |
hex | 26ba8949100 |
2661413064960 has 864 divisors, whose sum is σ = 10082464374528. Its totient is φ = 593560535040.
The previous prime is 2661413064923. The next prime is 2661413065001. The reversal of 2661413064960 is 694603141662.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 414482550 + ... + 414488970.
It is an arithmetic number, because the mean of its divisors is an integer number (11669518952).
Almost surely, 22661413064960 is an apocalyptic number.
2661413064960 is a gapful number since it is divisible by the number (20) 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 2661413064960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5041232187264).
2661413064960 is an abundant number, since it is smaller than the sum of its proper divisors (7421051309568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2661413064960 is a wasteful number, since it uses less digits than its factorization.
2661413064960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6519 (or 6486 counting only the distinct ones).
The product of its (nonzero) digits is 1119744, while the sum is 48.
The spelling of 2661413064960 in words is "two trillion, six hundred sixty-one billion, four hundred thirteen million, sixty-four thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •