Base | Representation |
---|---|
bin | 1100110000110… |
… | …00110110110000 |
3 | 21110110000222210 |
4 | 12120120312300 |
5 | 204401302220 |
6 | 14342332120 |
7 | 2436652152 |
oct | 630306660 |
9 | 243400883 |
10 | 107056560 |
11 | 554811a6 |
12 | 2ba2a040 |
13 | 192446a0 |
14 | 1030aad2 |
15 | 95ea6e0 |
hex | 6618db0 |
107056560 has 80 divisors (see below), whose sum is σ = 357414624. Its totient is φ = 26351616.
The previous prime is 107056529. The next prime is 107056561. The reversal of 107056560 is 65650701.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1070565602 = 22922214078067200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107056561) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14037 + ... + 20276.
Almost surely, 2107056560 is an apocalyptic number.
107056560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107056560 is an abundant number, since it is smaller than the sum of its proper divisors (250358064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107056560 is a wasteful number, since it uses less digits than its factorization.
107056560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34342 (or 34336 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 30.
The square root of 107056560 is about 10346.8140023874. The cubic root of 107056560 is about 474.8295750564.
It can be divided in two parts, 1070 and 56560, that added together give a triangular number (57630 = T339).
The spelling of 107056560 in words is "one hundred seven million, fifty-six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •