Base | Representation |
---|---|
bin | 10111110001101101110110… |
… | …110111100110010101001101 |
3 | 111201020221111000201011001001 |
4 | 113301231312313212111031 |
5 | 102201300030114322000 |
6 | 1010223302440220301 |
7 | 31012021546636564 |
oct | 2761556667462515 |
9 | 451227430634031 |
10 | 104571563042125 |
11 | 30357607186a63 |
12 | b88a804a6a691 |
13 | 464709629c88a |
14 | 1bb740d7c0bdb |
15 | c1522dd1c46a |
hex | 5f1b76de654d |
104571563042125 has 8 divisors (see below), whose sum is σ = 130505310676728. Its totient is φ = 83657250433600.
The previous prime is 104571563041963. The next prime is 104571563042171. The reversal of 104571563042125 is 521240365175401.
It can be written as a sum of positive squares in 4 ways, for example, as 44208847081 + 104527354195044 = 210259^2 + 10223862^2 .
It is not a de Polignac number, because 104571563042125 - 219 = 104571562517837 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 418286252044 + ... + 418286252293.
It is an arithmetic number, because the mean of its divisors is an integer number (16313163834591).
Almost surely, 2104571563042125 is an apocalyptic number.
It is an amenable number.
104571563042125 is a deficient number, since it is larger than the sum of its proper divisors (25933747634603).
104571563042125 is an frugal number, since it uses more digits than its factorization.
104571563042125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836572504352 (or 836572504342 counting only the distinct ones).
The product of its (nonzero) digits is 1008000, while the sum is 46.
The spelling of 104571563042125 in words is "one hundred four trillion, five hundred seventy-one billion, five hundred sixty-three million, forty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •