Base | Representation |
---|---|
bin | 1100011100100… |
… | …01000000111000 |
3 | 21021110012222210 |
4 | 12032101000320 |
5 | 203211344000 |
6 | 14205415120 |
7 | 2405260632 |
oct | 616210070 |
9 | 237405883 |
10 | 104403000 |
11 | 53a29579 |
12 | 2ab6a4a0 |
13 | 18825930 |
14 | dc19a52 |
15 | 9274350 |
hex | 6391038 |
104403000 has 128 divisors (see below), whose sum is σ = 350925120. Its totient is φ = 25689600.
The previous prime is 104402989. The next prime is 104403007. The reversal of 104403000 is 304401.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104403007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37662 + ... + 40338.
Almost surely, 2104403000 is an apocalyptic number.
104403000 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 104403000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175462560).
104403000 is an abundant number, since it is smaller than the sum of its proper divisors (246522120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104403000 is a wasteful number, since it uses less digits than its factorization.
104403000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2714 (or 2700 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 104403000 is about 10217.7786235561. The cubic root of 104403000 is about 470.8735827619.
Adding to 104403000 its reverse (304401), we get a palindrome (104707401).
The spelling of 104403000 in words is "one hundred four million, four hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •