Base | Representation |
---|---|
bin | 1001101011010011101001101… |
… | …0011110011111001010110000 |
3 | 10022021222210000121112201121211 |
4 | 2122310322122132133022300 |
5 | 1203222420441430210210 |
6 | 10412121205023525504 |
7 | 263266644302366023 |
oct | 23264723236371260 |
9 | 3267883017481554 |
10 | 680935296725680 |
11 | 187a70046067347 |
12 | 644559a5159894 |
13 | 232c4bcc971229 |
14 | c021630cb51ba |
15 | 53aca52c7738a |
hex | 26b4e9a79f2b0 |
680935296725680 has 40 divisors (see below), whose sum is σ = 1583187522192000. Its totient is φ = 272371889476608.
The previous prime is 680935296725603. The next prime is 680935296725689. The reversal of 680935296725680 is 86527692539086.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 680935296725597 and 680935296725606.
It is not an unprimeable number, because it can be changed into a prime (680935296725689) 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, 24978345 + ... + 44562184.
It is an arithmetic number, because the mean of its divisors is an integer number (39579688054800).
Almost surely, 2680935296725680 is an apocalyptic number.
It is an amenable number.
680935296725680 is an abundant number, since it is smaller than the sum of its proper divisors (902252225466320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
680935296725680 is a wasteful number, since it uses less digits than its factorization.
680935296725680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69662941 (or 69662935 counting only the distinct ones).
The product of its (nonzero) digits is 2351462400, while the sum is 76.
The spelling of 680935296725680 in words is "six hundred eighty trillion, nine hundred thirty-five billion, two hundred ninety-six million, seven hundred twenty-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •