Base | Representation |
---|---|
bin | 1100100101110… |
… | …11100001010000 |
3 | 21100202100012020 |
4 | 12102323201100 |
5 | 204020010210 |
6 | 14251531440 |
7 | 2421542406 |
oct | 622734120 |
9 | 240670166 |
10 | 105625680 |
11 | 54694156 |
12 | 2b459b80 |
13 | 18b63304 |
14 | 10057476 |
15 | 9416770 |
hex | 64bb850 |
105625680 has 80 divisors (see below), whose sum is σ = 338025984. Its totient is φ = 27256320.
The previous prime is 105625651. The next prime is 105625691. The reversal of 105625680 is 86526501.
105625680 = 4712 + 4722 + ... + 7492.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1056256802 = 22313568550924800, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 342 + ... + 14538.
Almost surely, 2105625680 is an apocalyptic number.
105625680 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 105625680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169012992).
105625680 is an abundant number, since it is smaller than the sum of its proper divisors (232400304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105625680 is a wasteful number, since it uses less digits than its factorization.
105625680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14244 (or 14238 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 33.
The square root of 105625680 is about 10277.4354777834. The cubic root of 105625680 is about 472.7046116984.
The spelling of 105625680 in words is "one hundred five million, six hundred twenty-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •