Base | Representation |
---|---|
bin | 1100010010010… |
… | …10001111100110 |
3 | 21011221012222120 |
4 | 12021022033212 |
5 | 202341031200 |
6 | 14121010410 |
7 | 2361014511 |
oct | 611121746 |
9 | 234835876 |
10 | 103064550 |
11 | 531a4a16 |
12 | 2a623a06 |
13 | 18477654 |
14 | d98bd78 |
15 | 90ac9a0 |
hex | 624a3e6 |
103064550 has 144 divisors (see below), whose sum is σ = 285130560. Its totient is φ = 24554880.
The previous prime is 103064543. The next prime is 103064567. The reversal of 103064550 is 55460301.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 103064550.
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 71 ways as a sum of consecutive naturals, for example, 2396829 + ... + 2396871.
Almost surely, 2103064550 is an apocalyptic number.
103064550 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 103064550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142565280).
103064550 is an abundant number, since it is smaller than the sum of its proper divisors (182066010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103064550 is a wasteful number, since it uses less digits than its factorization.
103064550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135 (or 101 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 103064550 is about 10152.0712172443. The cubic root of 103064550 is about 468.8527170456.
The spelling of 103064550 in words is "one hundred three million, sixty-four thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •