Base | Representation |
---|---|
bin | 10011110010110111001… |
… | …01100100010001010001 |
3 | 2102000120020001100212002 |
4 | 21321123211210101101 |
5 | 42120412200013223 |
6 | 1240241434443345 |
7 | 100065352400564 |
oct | 11713345442121 |
9 | 2360506040762 |
10 | 680141407313 |
11 | 2424a0103025 |
12 | ab995b93555 |
13 | 4c1a2173094 |
14 | 24cc1b0c4db |
15 | 12a5a96ee28 |
hex | 9e5b964451 |
680141407313 has 2 divisors, whose sum is σ = 680141407314. Its totient is φ = 680141407312.
The previous prime is 680141407223. The next prime is 680141407403. The reversal of 680141407313 is 313704141086.
It is a balanced prime because it is at equal distance from previous prime (680141407223) and next prime (680141407403).
It can be written as a sum of positive squares in only one way, i.e., 679030385089 + 1111022224 = 824033^2 + 33332^2 .
It is a cyclic number.
It is not a de Polignac number, because 680141407313 - 228 = 679872971857 is a prime.
It is not a weakly prime, because it can be changed into another prime (680141007313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 340070703656 + 340070703657.
It is an arithmetic number, because the mean of its divisors is an integer number (340070703657).
Almost surely, 2680141407313 is an apocalyptic number.
It is an amenable number.
680141407313 is a deficient number, since it is larger than the sum of its proper divisors (1).
680141407313 is an equidigital number, since it uses as much as digits as its factorization.
680141407313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 38.
Adding to 680141407313 its reverse (313704141086), we get a palindrome (993845548399).
The spelling of 680141407313 in words is "six hundred eighty billion, one hundred forty-one million, four hundred seven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •