Base | Representation |
---|---|
bin | 1100011000011… |
… | …10111010000000 |
3 | 21020110010222000 |
4 | 12030032322000 |
5 | 203042320310 |
6 | 14150144000 |
7 | 2400611136 |
oct | 614167200 |
9 | 236403860 |
10 | 103870080 |
11 | 536a5146 |
12 | 2a952000 |
13 | 1869a1b2 |
14 | db1b756 |
15 | 91bb4c0 |
hex | 630ee80 |
103870080 has 128 divisors (see below), whose sum is σ = 367934400. Its totient is φ = 27694080.
The previous prime is 103869977. The next prime is 103870111. The reversal of 103870080 is 80078301.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14275 + ... + 20285.
Almost surely, 2103870080 is an apocalyptic number.
103870080 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 103870080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (183967200).
103870080 is an abundant number, since it is smaller than the sum of its proper divisors (264064320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103870080 is an equidigital number, since it uses as much as digits as its factorization.
103870080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6039 (or 6021 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 103870080 is about 10191.6671845189. The cubic root of 103870080 is about 470.0710319684.
The spelling of 103870080 in words is "one hundred three million, eight hundred seventy thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •