Base | Representation |
---|---|
bin | 1100011110111… |
… | …11111001101101 |
3 | 21022001122020101 |
4 | 12033133321231 |
5 | 203302214000 |
6 | 14220351101 |
7 | 2411104660 |
oct | 617377155 |
9 | 238048211 |
10 | 104726125 |
11 | 5412a319 |
12 | 2b0a5491 |
13 | 18909a2a |
14 | dca16d7 |
15 | 92d9e6a |
hex | 63dfe6d |
104726125 has 16 divisors (see below), whose sum is σ = 149370624. Its totient is φ = 71811600.
The previous prime is 104726101. The next prime is 104726179. The reversal of 104726125 is 521627401.
It is not a de Polignac number, because 104726125 - 29 = 104725613 is a prime.
It is a super-2 number, since 2×1047261252 = 21935122515031250, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104726093 and 104726102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58969 + ... + 60718.
It is an arithmetic number, because the mean of its divisors is an integer number (9335664).
Almost surely, 2104726125 is an apocalyptic number.
It is an amenable number.
104726125 is a deficient number, since it is larger than the sum of its proper divisors (44644499).
104726125 is an equidigital number, since it uses as much as digits as its factorization.
104726125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119709 (or 119699 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 28.
The square root of 104726125 is about 10233.5783086856. The cubic root of 104726125 is about 471.3588636054.
It can be divided in two parts, 1047 and 26125, that added together give a palindrome (27172).
The spelling of 104726125 in words is "one hundred four million, seven hundred twenty-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •