Base | Representation |
---|---|
bin | 1100100110100… |
… | …00110000010000 |
3 | 21100220202111120 |
4 | 12103100300100 |
5 | 204030301111 |
6 | 14253442240 |
7 | 2422354110 |
oct | 623206020 |
9 | 240822446 |
10 | 105712656 |
11 | 54743535 |
12 | 2b4a0380 |
13 | 18b93a8a |
14 | 1007b040 |
15 | 9432406 |
hex | 64d0c10 |
105712656 has 160 divisors (see below), whose sum is σ = 340454400. Its totient is φ = 27578880.
The previous prime is 105712643. The next prime is 105712693. The reversal of 105712656 is 656217501.
It is a super-2 number, since 2×1057126562 = 22350331277148672, 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 31 ways as a sum of consecutive naturals, for example, 184851 + ... + 185421.
It is an arithmetic number, because the mean of its divisors is an integer number (2127840).
Almost surely, 2105712656 is an apocalyptic number.
105712656 is a gapful number since it is divisible by the number (16) 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 105712656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170227200).
105712656 is an abundant number, since it is smaller than the sum of its proper divisors (234741744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105712656 is a wasteful number, since it uses less digits than its factorization.
105712656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 637 (or 631 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 33.
The square root of 105712656 is about 10281.6660128600. Note that the first 3 decimals coincide. The cubic root of 105712656 is about 472.8343234521.
The spelling of 105712656 in words is "one hundred five million, seven hundred twelve thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •