Base | Representation |
---|---|
bin | 110001100101101100… |
… | …1100110010101010000 |
3 | 101011212120220220021210 |
4 | 1203023121212111100 |
5 | 3221043333404220 |
6 | 120531022420120 |
7 | 10456651343130 |
oct | 1431331462520 |
9 | 334776826253 |
10 | 106491700560 |
11 | 41187874893 |
12 | 1877ba31640 |
13 | a071715a8b |
14 | 52232a4ac0 |
15 | 2b840eb6e0 |
hex | 18cb666550 |
106491700560 has 320 divisors, whose sum is σ = 400153388544. Its totient is φ = 22870425600.
The previous prime is 106491700559. The next prime is 106491700583. The reversal of 106491700560 is 65007194601.
It is a super-2 number, since 2×1064917005602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18875340 + ... + 18880980.
Almost surely, 2106491700560 is an apocalyptic number.
106491700560 is a gapful number since it is divisible by the number (10) 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 106491700560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200076694272).
106491700560 is an abundant number, since it is smaller than the sum of its proper divisors (293661687984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106491700560 is a wasteful number, since it uses less digits than its factorization.
106491700560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6342 (or 6336 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 39.
The spelling of 106491700560 in words is "one hundred six billion, four hundred ninety-one million, seven hundred thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •