Base | Representation |
---|---|
bin | 1100010111111… |
… | …10100011000000 |
3 | 21020022202001020 |
4 | 12023332203000 |
5 | 203033144242 |
6 | 14144505440 |
7 | 2400211602 |
oct | 613764300 |
9 | 236282036 |
10 | 103803072 |
11 | 5365986a |
12 | 2a91b280 |
13 | 18675849 |
14 | db01172 |
15 | 91a66ec |
hex | 62fe8c0 |
103803072 has 56 divisors (see below), whose sum is σ = 280513536. Its totient is φ = 33861888.
The previous prime is 103803059. The next prime is 103803079. The reversal of 103803072 is 270308301.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (103803079) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3273 + ... + 14775.
Almost surely, 2103803072 is an apocalyptic number.
103803072 is a gapful number since it is divisible by the number (12) 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 103803072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140256768).
103803072 is an abundant number, since it is smaller than the sum of its proper divisors (176710464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103803072 is a wasteful number, since it uses less digits than its factorization.
103803072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11565 (or 11555 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 24.
The square root of 103803072 is about 10188.3792626698. The cubic root of 103803072 is about 469.9699271539.
The spelling of 103803072 in words is "one hundred three million, eight hundred three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •