Base | Representation |
---|---|
bin | 110000011111000011… |
… | …1101101110011100101 |
3 | 100221202101211102122201 |
4 | 1200332013231303211 |
5 | 3201220041101000 |
6 | 115455511254501 |
7 | 10344140340124 |
oct | 1407607556345 |
9 | 327671742581 |
10 | 104121425125 |
11 | 40180914873 |
12 | 1821a07a431 |
13 | 9a84636933 |
14 | 507a581abb |
15 | 2a95e9796a |
hex | 183e1edce5 |
104121425125 has 8 divisors (see below), whose sum is σ = 129943538712. Its totient is φ = 83297140000.
The previous prime is 104121425071. The next prime is 104121425129. The reversal of 104121425125 is 521524121401.
It can be written as a sum of positive squares in 4 ways, for example, as 232532001 + 103888893124 = 15249^2 + 322318^2 .
It is not a de Polignac number, because 104121425125 - 29 = 104121424613 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104121425093 and 104121425102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104121425129) 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, 416485576 + ... + 416485825.
It is an arithmetic number, because the mean of its divisors is an integer number (16242942339).
Almost surely, 2104121425125 is an apocalyptic number.
It is an amenable number.
104121425125 is a deficient number, since it is larger than the sum of its proper divisors (25822113587).
104121425125 is an frugal number, since it uses more digits than its factorization.
104121425125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832971416 (or 832971406 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 28.
Adding to 104121425125 its reverse (521524121401), we get a palindrome (625645546526).
The spelling of 104121425125 in words is "one hundred four billion, one hundred twenty-one million, four hundred twenty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •