Properties of the Number 6425

Six Thousand Four Hundred Twenty-Five

Basics

Value: 6424 → 6425 → 6426

Parity: odd

Prime: No

Previous Prime: 6421

Next Prime: 6427

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 ² × 257

Divisors: 1, 5, 25, 257, 1285, 6425

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1100100011001

Octal: 14431

Duodecimal: 3875

Hexadecimal: 1919

Square: 41280625

Square Root: 80.15609770940699

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

Number of partitions of n that sorted in increasing order contain a part k in position k for some k. A238395

Triangle T(n,m) of numbers of m-block T₀-covers of a labeled n-set, m = 0..2ⁿ - 1. A59202

Every suffix prime and no 0 digits in base 9 (written in base 9). A24784

Relative of Hofstadter Q-sequence: a(n) = max(0, n+3201) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0. A373236

Numbers k such that continued fraction of (1 + sqrt(k))/2 has period 11. A146335

Number of polynomials a_k*x^k + ... + a₁*x + a₀ with k > 0, integer coefficients and only non-multiple positive integer roots and a₀ = pⁿ (p is a prime). A248956

Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 331", based on the 5-celled von Neumann neighborhood. A271277

Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 547", based on the 5-celled von Neumann neighborhood. A272838

Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 563", based on the 5-celled von Neumann neighborhood. A272939

Triangle read by rows: T(m,n) (1 <= n < m) is the number of moves of an (m,n)-leaper (a generalization of a chess knight) until it can no longer move, starting on a board with squares spirally numbered from 1. Each move is to the lowest-numbered unvisited square. T(m,n) = -1 if the path never terminates. A323749