64 (number) it is possible to find sequences of 64 consecutive integers such that each inner member shares a factor with either the first or the last member, 64 is an Erdős–Woods number. In base 10, no integer added up to its own digits yields 64, hence it is a self number. 64 is a superperfect number—a number such that σ(σ("n")) = 2"n". 64 is the index of Graham's number in the rapidly growing sequence 3↑↑↑↑3, 3 ↑ 3,… Sixty-four is: 64 (number) 64 (sixty-four) is the natural number following 63 and preceding 65. Sixty-four is the square of 8, the cube
Square-free integer algorithm is known for computing any of these square-free factors, which is faster than computing the complete prime factorization. In particular, there is no known polynomial-time algorithm for computing the square-free part of an integer, and no known polynomial-time algorithm for determining whether a number is square-free. On the opposite, polynomial-time algorithms are known for primality testing. This is a major difference between the arithmetic of the integers, and the arithmetic of the univariate polynomials, as polynomial-time algorithms are known for square-free factorization of polynomials (in short, the largest square-free factor of a polynomial is its quotient by the greatest