Base | Representation |
---|---|
bin | 1100011001101… |
… | …01111101000101 |
3 | 21020202021100202 |
4 | 12030311331011 |
5 | 203112430041 |
6 | 14153420245 |
7 | 2402145344 |
oct | 614657505 |
9 | 236667322 |
10 | 104030021 |
11 | 537a4327 |
12 | 2aa0a685 |
13 | 18724c34 |
14 | db5db5b |
15 | 91eda9b |
hex | 6335f45 |
104030021 has 8 divisors (see below), whose sum is σ = 110289600. Its totient is φ = 97786048.
The previous prime is 104030009. The next prime is 104030033. The reversal of 104030021 is 120030401.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (104030009) and next prime (104030033).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104030021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104029984 and 104030011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104030041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11630 + ... + 18528.
It is an arithmetic number, because the mean of its divisors is an integer number (13786200).
Almost surely, 2104030021 is an apocalyptic number.
It is an amenable number.
104030021 is a deficient number, since it is larger than the sum of its proper divisors (6259579).
104030021 is an equidigital number, since it uses as much as digits as its factorization.
104030021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7803.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 104030021 is about 10199.5108216032. The cubic root of 104030021 is about 470.3121828182.
Adding to 104030021 its reverse (120030401), we get a palindrome (224060422).
The spelling of 104030021 in words is "one hundred four million, thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •