Properties of the Number 64679

Sixty-Four Thousand Six Hundred Seventy-Nine

Basics

Value: 64678 → 64679 → 64680

Parity: odd

Prime: Yes

Previous Prime: 64667

Next Prime: 64693

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 64679

Divisors: 1, 64679

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111110010100111

Octal: 176247

Duodecimal: 3151B

Hexadecimal: fca7

Square: 4183373041

Square Root: 254.32066372986682

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Primes p such that π(p) is obtained by dropping one of the digits of p in decimal expansion. A114924

Primes equal to a sum of primes with differences congruent to (2,4) mod 6. A104160

Prime numbers of the form 3p+8 where p, p+2 and p+6 are prime numbers. A376013

Fourth term of weak prime sextet: p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1). A54831

Lexicographically earliest strictly increasing sequence of primes whose partial products lie between noncomposite numbers. A359939

Primes associated with the indices in A362060. A362066

Number of 3X3 0..n matrices whose square is also a 0..n matrix. A213992

Number of n X 3 nonnegative integer arrays with upper left 0 and every value within 3 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down. A252933

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 825", based on the 5-celled von Neumann neighborhood. A273581

A triangle sequence of coefficients of polynomials with roots that are inverse primes: a(n)=Prime[n](a(n-1); p(x,n)=If[n == 0, 1, a[n - 1]*(x - a[n - 1])*Product[x + 1/Prime[i], {i, 1, n - 1}]]. (Correction to previous submission). A144456