Base | Representation |
---|---|
bin | 1100011100010… |
… | …10100100110101 |
3 | 21021101212211002 |
4 | 12032022210311 |
5 | 203210023004 |
6 | 14205053045 |
7 | 2405121020 |
oct | 616124465 |
9 | 237355732 |
10 | 104376629 |
11 | 53a10785 |
12 | 2ab57185 |
13 | 18816926 |
14 | dc101b7 |
15 | 926b61e |
hex | 638a935 |
104376629 has 8 divisors (see below), whose sum is σ = 120146880. Its totient is φ = 88821216.
The previous prime is 104376581. The next prime is 104376677. The reversal of 104376629 is 926673401.
It is an interprime number because it is at equal distance from previous prime (104376581) and next prime (104376677).
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-104376629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104376592 and 104376601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104376689) 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, 52664 + ... + 54609.
It is an arithmetic number, because the mean of its divisors is an integer number (15018360).
Almost surely, 2104376629 is an apocalyptic number.
It is an amenable number.
104376629 is a deficient number, since it is larger than the sum of its proper divisors (15770251).
104376629 is a wasteful number, since it uses less digits than its factorization.
104376629 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107419.
The product of its (nonzero) digits is 54432, while the sum is 38.
The square root of 104376629 is about 10216.4880952312. The cubic root of 104376629 is about 470.8339336685.
The spelling of 104376629 in words is "one hundred four million, three hundred seventy-six thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •