Base | Representation |
---|---|
bin | 1100100000011… |
… | …01110011001101 |
3 | 21022102012010100 |
4 | 12100031303031 |
5 | 203324223000 |
6 | 14224401313 |
7 | 2412520041 |
oct | 620156315 |
9 | 238365110 |
10 | 104914125 |
11 | 54248598 |
12 | 2b176239 |
13 | 18974484 |
14 | dd10021 |
15 | 9325a00 |
hex | 640dccd |
104914125 has 24 divisors (see below), whose sum is σ = 189127224. Its totient is φ = 55953600.
The previous prime is 104914111. The next prime is 104914169. The reversal of 104914125 is 521419401.
It can be written as a sum of positive squares in 4 ways, for example, as 751689 + 104162436 = 867^2 + 10206^2 .
It is not a de Polignac number, because 104914125 - 25 = 104914093 is a prime.
It is a super-2 number, since 2×1049141252 = 22013947249031250, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 45504 + ... + 47753.
It is an arithmetic number, because the mean of its divisors is an integer number (7880301).
Almost surely, 2104914125 is an apocalyptic number.
104914125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
104914125 is a deficient number, since it is larger than the sum of its proper divisors (84213099).
104914125 is an equidigital number, since it uses as much as digits as its factorization.
104914125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93278 (or 93265 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 104914125 is about 10242.7596379101. The cubic root of 104914125 is about 471.6407496293.
The spelling of 104914125 in words is "one hundred four million, nine hundred fourteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •