Base | Representation |
---|---|
bin | 1100011110010… |
… | …01010010110001 |
3 | 21021212221012121 |
4 | 12033021102301 |
5 | 203241233041 |
6 | 14214354241 |
7 | 2410240666 |
oct | 617112261 |
9 | 237787177 |
10 | 104633521 |
11 | 54076793 |
12 | 2b05b981 |
13 | 188a6835 |
14 | dc79a6d |
15 | 92bc7d1 |
hex | 63c94b1 |
104633521 has 8 divisors (see below), whose sum is σ = 113783400. Its totient is φ = 95816448.
The previous prime is 104633497. The next prime is 104633527. The reversal of 104633521 is 125336401.
It can be written as a sum of positive squares in 4 ways, for example, as 43230625 + 61402896 = 6575^2 + 7836^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104633521 - 25 = 104633489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104633527) 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, 82546 + ... + 83803.
It is an arithmetic number, because the mean of its divisors is an integer number (14222925).
Almost surely, 2104633521 is an apocalyptic number.
It is an amenable number.
104633521 is a deficient number, since it is larger than the sum of its proper divisors (9149879).
104633521 is a wasteful number, since it uses less digits than its factorization.
104633521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166403.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 104633521 is about 10229.0527909479. The cubic root of 104633521 is about 471.2198897239.
Adding to 104633521 its reverse (125336401), we get a palindrome (229969922).
The spelling of 104633521 in words is "one hundred four million, six hundred thirty-three thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •