Base | Representation |
---|---|
bin | 1100010111001… |
… | …11000001011000 |
3 | 21020010211212100 |
4 | 12023213001120 |
5 | 203022103322 |
6 | 14142443400 |
7 | 2366330634 |
oct | 613470130 |
9 | 236124770 |
10 | 103706712 |
11 | 535a342a |
12 | 2a893560 |
13 | 18640a25 |
14 | dab7dc4 |
15 | 9187dac |
hex | 62e7058 |
103706712 has 144 divisors (see below), whose sum is σ = 310073400. Its totient is φ = 31207680.
The previous prime is 103706689. The next prime is 103706737. The reversal of 103706712 is 217607301.
It is a super-2 number, since 2×1037067122 = 21510164227701888, which contains 22 as substring.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2411763 + ... + 2411805.
Almost surely, 2103706712 is an apocalyptic number.
103706712 is a gapful number since it is divisible by the number (12) 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 103706712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155036700).
103706712 is an abundant number, since it is smaller than the sum of its proper divisors (206366688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103706712 is a wasteful number, since it uses less digits than its factorization.
103706712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158 (or 108 counting only the distinct ones).
The product of its (nonzero) digits is 1764, while the sum is 27.
The square root of 103706712 is about 10183.6492476911. The cubic root of 103706712 is about 469.8244583619.
The spelling of 103706712 in words is "one hundred three million, seven hundred six thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •