Base | Representation |
---|---|
bin | 10111110001000010100110… |
… | …110100111110110100111110 |
3 | 111201002111121112121200220221 |
4 | 113301002212310332310332 |
5 | 102200014422443202032 |
6 | 1010150102325331554 |
7 | 31005455663165404 |
oct | 2761024664766476 |
9 | 451074545550827 |
10 | 104525123022142 |
11 | 30339945a88659 |
12 | b881804266bba |
13 | 46428a4c3a304 |
14 | 1bb5085bc3474 |
15 | c13e11c81597 |
hex | 5f10a6d3ed3e |
104525123022142 has 8 divisors (see below), whose sum is σ = 157224419031600. Its totient is φ = 52116983344944.
The previous prime is 104525123022127. The next prime is 104525123022157. The reversal of 104525123022142 is 241220321525401.
It is an interprime number because it is at equal distance from previous prime (104525123022127) and next prime (104525123022157).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 104525123022098 and 104525123022107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72789082167 + ... + 72789083602.
It is an arithmetic number, because the mean of its divisors is an integer number (19653052378950).
Almost surely, 2104525123022142 is an apocalyptic number.
104525123022142 is a deficient number, since it is larger than the sum of its proper divisors (52699296009458).
104525123022142 is a wasteful number, since it uses less digits than its factorization.
104525123022142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145578166130.
The product of its (nonzero) digits is 38400, while the sum is 34.
Adding to 104525123022142 its reverse (241220321525401), we get a palindrome (345745444547543).
The spelling of 104525123022142 in words is "one hundred four trillion, five hundred twenty-five billion, one hundred twenty-three million, twenty-two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •