Base | Representation |
---|---|
bin | 1100010110101… |
… | …10101111000000 |
3 | 21020000110100112 |
4 | 12023112233000 |
5 | 203012440000 |
6 | 14141210452 |
7 | 2365632302 |
oct | 613265700 |
9 | 236013315 |
10 | 103640000 |
11 | 535582a2 |
12 | 2a860a28 |
13 | 18619559 |
14 | da9b972 |
15 | 9173235 |
hex | 62d6bc0 |
103640000 has 70 divisors (see below), whose sum is σ = 257092704. Its totient is φ = 41440000.
The previous prime is 103639999. The next prime is 103640023. The reversal of 103640000 is 46301.
It is a super-3 number, since 3×1036400003 (a number of 25 digits) contains 333 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 (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 38705 + ... + 41295.
Almost surely, 2103640000 is an apocalyptic number.
103640000 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 103640000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128546352).
103640000 is an abundant number, since it is smaller than the sum of its proper divisors (153452704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103640000 is an frugal number, since it uses more digits than its factorization.
103640000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2623 (or 2598 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 103640000 is about 10180.3732740995. The cubic root of 103640000 is about 469.7236945451.
Adding to 103640000 its reverse (46301), we get a palindrome (103686301).
The spelling of 103640000 in words is "one hundred three million, six hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •