Base | Representation |
---|---|
bin | 1100010010011… |
… | …10000011010110 |
3 | 21011222000101100 |
4 | 12021032003112 |
5 | 202342031100 |
6 | 14121210530 |
7 | 2361111135 |
oct | 611160326 |
9 | 234860340 |
10 | 103080150 |
11 | 53205708 |
12 | 2a630a46 |
13 | 18481794 |
14 | d99391c |
15 | 90b2400 |
hex | 624e0d6 |
103080150 has 144 divisors (see below), whose sum is σ = 293293728. Its totient is φ = 25920000.
The previous prime is 103080127. The next prime is 103080157. The reversal of 103080150 is 51080301.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103080157) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 682575 + ... + 682725.
It is an arithmetic number, because the mean of its divisors is an integer number (2036762).
Almost surely, 2103080150 is an apocalyptic number.
103080150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 103080150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146646864).
103080150 is an abundant number, since it is smaller than the sum of its proper divisors (190213578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103080150 is a wasteful number, since it uses less digits than its factorization.
103080150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247 (or 239 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 103080150 is about 10152.8395042963. The cubic root of 103080150 is about 468.8763712616.
The spelling of 103080150 in words is "one hundred three million, eighty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •