Base | Representation |
---|---|
bin | 10011111110100100000… |
… | …11110001110110101101 |
3 | 2102121210001212110010121 |
4 | 21333102003301312231 |
5 | 42221244021143221 |
6 | 1243201104404541 |
7 | 100410140532163 |
oct | 11772203616655 |
9 | 2377701773117 |
10 | 686424006061 |
11 | 2451245024a2 |
12 | b104a016751 |
13 | 4c963956331 |
14 | 2531a281233 |
15 | 12cc72caa41 |
hex | 9fd20f1dad |
686424006061 has 2 divisors, whose sum is σ = 686424006062. Its totient is φ = 686424006060.
The previous prime is 686424006043. The next prime is 686424006067. The reversal of 686424006061 is 160600424686.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 385976412900 + 300447593161 = 621270^2 + 548131^2 .
It is a cyclic number.
It is not a de Polignac number, because 686424006061 - 29 = 686424005549 is a prime.
It is a super-3 number, since 3×6864240060613 (a number of 36 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 686424005999 and 686424006017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (686424006067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 343212003030 + 343212003031.
It is an arithmetic number, because the mean of its divisors is an integer number (343212003031).
Almost surely, 2686424006061 is an apocalyptic number.
It is an amenable number.
686424006061 is a deficient number, since it is larger than the sum of its proper divisors (1).
686424006061 is an equidigital number, since it uses as much as digits as its factorization.
686424006061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 331776, while the sum is 43.
The spelling of 686424006061 in words is "six hundred eighty-six billion, four hundred twenty-four million, six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •