Base | Representation |
---|---|
bin | 11000000001100111101001… |
… | …000111111011110000100000 |
3 | 111212010102021211021222110022 |
4 | 120001213221013323300200 |
5 | 102322201143303320000 |
6 | 1012421320031453012 |
7 | 31154000242403456 |
oct | 3001475107736040 |
9 | 455112254258408 |
10 | 105664401620000 |
11 | 3073902605a573 |
12 | ba26576387168 |
13 | 46c61584a4062 |
14 | 1c14281b0c9d6 |
15 | c33890c1a585 |
hex | 6019e91fbc20 |
105664401620000 has 120 divisors (see below), whose sum is σ = 262335147990300. Its totient is φ = 41878000512000.
The previous prime is 105664401619963. The next prime is 105664401620017. The reversal of 105664401620000 is 26104466501.
It can be written as a sum of positive squares in 10 ways, for example, as 64192144 + 105664337427856 = 8012^2 + 10279316^2 .
It is a super-2 number, since 2×1056644016200002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 22054955 + ... + 26414954.
Almost surely, 2105664401620000 is an apocalyptic number.
105664401620000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105664401620000 is an abundant number, since it is smaller than the sum of its proper divisors (156670746370300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105664401620000 is an equidigital number, since it uses as much as digits as its factorization.
105664401620000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48470048 (or 48470025 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 35.
The spelling of 105664401620000 in words is "one hundred five trillion, six hundred sixty-four billion, four hundred one million, six hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •