Base | Representation |
---|---|
bin | 100110101110011001110… |
… | …110101011010010000000 |
3 | 100102101221020022211001222 |
4 | 212232121312223102000 |
5 | 322100031444101303 |
6 | 5354304531014212 |
7 | 363156113543300 |
oct | 46563166532200 |
9 | 10371836284058 |
10 | 2661166003328 |
11 | 936659917a58 |
12 | 36b90313a368 |
13 | 163c4039c051 |
14 | 92b303c7600 |
15 | 49352b20938 |
hex | 26b99dab480 |
2661166003328 has 96 divisors (see below), whose sum is σ = 6167770795260. Its totient is φ = 1140375570432.
The previous prime is 2661166003303. The next prime is 2661166003333. The reversal of 2661166003328 is 8233006611662.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 2550255690304 + 110910313024 = 1596952^2 + 333032^2 .
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, 79342850 + ... + 79376382.
Almost surely, 22661166003328 is an apocalyptic number.
2661166003328 is a gapful number since it is divisible by the number (28) 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 2661166003328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3083885397630).
2661166003328 is an abundant number, since it is smaller than the sum of its proper divisors (3506604791932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2661166003328 is a wasteful number, since it uses less digits than its factorization.
2661166003328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46214 (or 46195 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 44.
The spelling of 2661166003328 in words is "two trillion, six hundred sixty-one billion, one hundred sixty-six million, three thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •