Base | Representation |
---|---|
bin | 110000100010111010… |
… | …0001001001011111101 |
3 | 100222002101201201201201 |
4 | 1201011310021023331 |
5 | 3202001112342000 |
6 | 115520402135501 |
7 | 10350265506064 |
oct | 1410564111375 |
9 | 328071651651 |
10 | 104250512125 |
11 | 40237772841 |
12 | 18255351591 |
13 | 9aa52c2986 |
14 | 508d7851db |
15 | 2aa249596a |
hex | 1845d092fd |
104250512125 has 8 divisors (see below), whose sum is σ = 130104639288. Its totient is φ = 83400409600.
The previous prime is 104250512123. The next prime is 104250512137. The reversal of 104250512125 is 521215052401.
It can be written as a sum of positive squares in 4 ways, for example, as 16565234436 + 87685277689 = 128706^2 + 296117^2 .
It is not a de Polignac number, because 104250512125 - 21 = 104250512123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104250512093 and 104250512102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104250512123) 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, 417001924 + ... + 417002173.
It is an arithmetic number, because the mean of its divisors is an integer number (16263079911).
Almost surely, 2104250512125 is an apocalyptic number.
It is an amenable number.
104250512125 is a deficient number, since it is larger than the sum of its proper divisors (25854127163).
104250512125 is an frugal number, since it uses more digits than its factorization.
104250512125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 834004112 (or 834004102 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 28.
Adding to 104250512125 its reverse (521215052401), we get a palindrome (625465564526).
The spelling of 104250512125 in words is "one hundred four billion, two hundred fifty million, five hundred twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •