Properties of the Number 26402

Twenty-Six Thousand Four Hundred Two

Basics

Value: 26401 → 26402 → 26403

Parity: even

Prime: No

Previous Prime: 26399

Next Prime: 26407

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 43 × 307

Divisors: 1, 2, 43, 86, 307, 614, 13201, 26402

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011100100010

Octal: 63442

Duodecimal: 13342

Hexadecimal: 6722

Square: 697065604

Square Root: 162.48692255070867

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

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} whose longest block is of length k (0<=k<=n). A184182

Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) is a part of p. A241735

Number of compositions (ordered partitions) of n into distinct parts, the least being 6. A339169

Numbers k such that Fibonacci(k) == +-1 (mod k) and k is neither 1 nor prime nor twice a prime. A279072

Number of permutations of [n] whose longest block is of length 3. A block of a permutation is a maximal sequence of consecutive integers which appear in consecutive positions. A370392

Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057040(n)=i(F(n)), where F(n) is the n-th Fibonacci number. A57040

a(n) = prime(n)² - prime(n+1). A62235

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

Numbers that cannot be partitioned into two or more distinct even-valued terms or distinct odd-valued terms of the sequence. A279953

Addends k > 0 such that the polynomial x² + x + k produces a record of its Hardy-Littlewood Constant. A331940