Base | Representation |
---|---|
bin | 11001000101000011100… |
… | …11101010111011001101 |
3 | 10001101012220212212000101 |
4 | 30202201303222323031 |
5 | 103104234240324031 |
6 | 1455510243531101 |
7 | 116153634206326 |
oct | 14424163527315 |
9 | 3041186785011 |
10 | 861708136141 |
11 | 3024a2861816 |
12 | 11b008389a91 |
13 | 633495714b8 |
14 | 2d9c7a1b44d |
15 | 176359a4361 |
hex | c8a1ceaecd |
861708136141 has 4 divisors (see below), whose sum is σ = 862747591900. Its totient is φ = 860668680384.
The previous prime is 861708136129. The next prime is 861708136189. The reversal of 861708136141 is 141631807168.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 181365256900 + 680342879241 = 425870^2 + 824829^2 .
It is a cyclic number.
It is not a de Polignac number, because 861708136141 - 213 = 861708127949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 861708136091 and 861708136100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (861708106141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 519726636 + ... + 519728293.
It is an arithmetic number, because the mean of its divisors is an integer number (215686897975).
Almost surely, 2861708136141 is an apocalyptic number.
It is an amenable number.
861708136141 is a deficient number, since it is larger than the sum of its proper divisors (1039455759).
861708136141 is a wasteful number, since it uses less digits than its factorization.
861708136141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1039455758.
The product of its (nonzero) digits is 193536, while the sum is 46.
The spelling of 861708136141 in words is "eight hundred sixty-one billion, seven hundred eight million, one hundred thirty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •