Base | Representation |
---|---|
bin | 100110101110100101101… |
… | …000101000110111100110 |
3 | 100102102110000020022100220 |
4 | 212232211220220313212 |
5 | 322100433043300042 |
6 | 5354340311145210 |
7 | 363164033526600 |
oct | 46564550506746 |
9 | 10372400208326 |
10 | 2661363650022 |
11 | 936750442930 |
12 | 36b959375206 |
13 | 163c7231115c |
14 | 92b4c756170 |
15 | 493651628ec |
hex | 26ba5a28de6 |
2661363650022 has 96 divisors (see below), whose sum is σ = 6769285737984. Its totient is φ = 689763412800.
The previous prime is 2661363650003. The next prime is 2661363650053. The reversal of 2661363650022 is 2200563631662.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 598323 + ... + 2383425.
It is an arithmetic number, because the mean of its divisors is an integer number (70513393104).
Almost surely, 22661363650022 is an apocalyptic number.
2661363650022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 2661363650022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3384642868992).
2661363650022 is an abundant number, since it is smaller than the sum of its proper divisors (4107922087962).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2661363650022 is a wasteful number, since it uses less digits than its factorization.
2661363650022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1785594 (or 1785587 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 42.
The spelling of 2661363650022 in words is "two trillion, six hundred sixty-one billion, three hundred sixty-three million, six hundred fifty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •