Base | Representation |
---|---|
bin | 1100010101010… |
… | …00011001011000 |
3 | 21012122210222220 |
4 | 12022220121120 |
5 | 202440401300 |
6 | 14133144040 |
7 | 2364212040 |
oct | 612503130 |
9 | 235583886 |
10 | 103450200 |
11 | 53438737 |
12 | 2a78b020 |
13 | 18581049 |
14 | da4c720 |
15 | 9136da0 |
hex | 62a8658 |
103450200 has 96 divisors (see below), whose sum is σ = 366524160. Its totient is φ = 23644800.
The previous prime is 103450183. The next prime is 103450201. The reversal of 103450200 is 2054301.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 103450200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103450201) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 8116 + ... + 16515.
It is an arithmetic number, because the mean of its divisors is an integer number (3817960).
Almost surely, 2103450200 is an apocalyptic number.
103450200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103450200 is an abundant number, since it is smaller than the sum of its proper divisors (263073960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103450200 is a wasteful number, since it uses less digits than its factorization.
103450200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24657 (or 24648 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 15.
The square root of 103450200 is about 10171.0471437311. The cubic root of 103450200 is about 469.4367781804.
The spelling of 103450200 in words is "one hundred three million, four hundred fifty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •