Base | Representation |
---|---|
bin | 1100011011110… |
… | …00100110011000 |
3 | 21021021010211002 |
4 | 12031320212120 |
5 | 203200144000 |
6 | 14203324132 |
7 | 2404363244 |
oct | 615704630 |
9 | 237233732 |
10 | 104303000 |
11 | 5397042a |
12 | 2ab20648 |
13 | 187bc269 |
14 | dbd1424 |
15 | 92548d5 |
hex | 6378998 |
104303000 has 64 divisors (see below), whose sum is σ = 250754400. Its totient is φ = 40579200.
The previous prime is 104302981. The next prime is 104303009. The reversal of 104303000 is 303401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104303009) 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 15 ways as a sum of consecutive naturals, for example, 35591 + ... + 38409.
Almost surely, 2104303000 is an apocalyptic number.
104303000 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 104303000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125377200).
104303000 is an abundant number, since it is smaller than the sum of its proper divisors (146451400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104303000 is a wasteful number, since it uses less digits than its factorization.
104303000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2877 (or 2863 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 11.
The square root of 104303000 is about 10212.8840197077. The cubic root of 104303000 is about 470.7231962783.
Adding to 104303000 its reverse (303401), we get a palindrome (104606401).
The spelling of 104303000 in words is "one hundred four million, three hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •