Base | Representation |
---|---|
bin | 10011110011011110100… |
… | …00111000100111100101 |
3 | 2102001102020020022222200 |
4 | 21321233100320213211 |
5 | 42122101202424312 |
6 | 1240334310245113 |
7 | 100106501366352 |
oct | 11715720704745 |
9 | 2361366208880 |
10 | 680471529957 |
11 | 24264a49105a |
12 | aba68656799 |
13 | 4c22568991b |
14 | 24d138c3629 |
15 | 12a7992e0dc |
hex | 9e6f4389e5 |
680471529957 has 12 divisors (see below), whose sum is σ = 991920784140. Its totient is φ = 449485780608.
The previous prime is 680471529929. The next prime is 680471529967. The reversal of 680471529957 is 759925174086.
680471529957 is a `hidden beast` number, since 68 + 0 + 47 + 1 + 529 + 9 + 5 + 7 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 582025564836 + 98445965121 = 762906^2 + 313761^2 .
It is not a de Polignac number, because 680471529957 - 223 = 680463141349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 680471529894 and 680471529903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (680471529967) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 346824468 + ... + 346826429.
It is an arithmetic number, because the mean of its divisors is an integer number (82660065345).
Almost surely, 2680471529957 is an apocalyptic number.
It is an amenable number.
680471529957 is a deficient number, since it is larger than the sum of its proper divisors (311449254183).
680471529957 is a wasteful number, since it uses less digits than its factorization.
680471529957 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 693651012 (or 693651009 counting only the distinct ones).
The product of its (nonzero) digits is 38102400, while the sum is 63.
The spelling of 680471529957 in words is "six hundred eighty billion, four hundred seventy-one million, five hundred twenty-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •