Properties of the Number 6410

Six Thousand Four Hundred Ten

Basics

Value: 6409 → 6410 → 6411

Parity: even

Prime: No

Previous Prime: 6397

Next Prime: 6421

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 641

Divisors: 1, 2, 5, 10, 641, 1282, 3205, 6410

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1100100001010

Octal: 14412

Duodecimal: 3862

Hexadecimal: 190a

Square: 41088100

Square Root: 80.06247560499239

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

Numbers k such that k | 13^k + 1. A15963

G.f. satisfies: A(x) = (1+x) * A(x²)*A(x³)*A(x⁴)*...*A(xⁿ)*... A129373

Square array T(n,k), n >= 2, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding closed paths in the n X k grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph. A333758

For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u·x+v·y with u,v minimal; a(n) = sum of the values of u²+v². A345434

a(1) = 1; thereafter, a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any three consecutive digits in the sequence sum up to a prime. A152603

Coordination sequence for root lattice B₃. A22145

a(n) = 5·a(n-2) + 2·a(n-3). A135138

Numbers such that zero or more applications of A003415 (arithmetic derivative) will yield 7. A328117

Numbers k with a Goldbach partition (p,q) such that k | (p·q - 1). A336582

a(n) = 6·binomial(n,4) + 5·binomial(n,2) - 4·n + 5. A66455