Properties of the Number 26436

Twenty-Six Thousand Four Hundred Thirty-Six

Basics

Value: 26435 → 26436 → 26437

Parity: even

Prime: No

Previous Prime: 26431

Next Prime: 26437

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 2203

Divisors: 1, 2, 3, 4, 6, 12, 2203, 4406, 6609, 8812

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011101000100

Octal: 63504

Duodecimal: 13370

Hexadecimal: 6744

Square: 698862096

Square Root: 162.59151269362124

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 of the form 42·k³ + 270·k² - 26436·k + 250703 in order of increasing k. A271144

Numbers k such that 42·k³ + 270·k² - 26436·k + 250703 is prime. A271143

Place n equally spaced points on each side of an equilateral triangle, and join each of these points by a chord to the 2·n new points on the other two sides: sequence gives number of regions in the resulting planar graph. A366486

Number of aperiodic necklaces with n red or blue beads such that two necklaces are equivalent under the operation of simultaneously turning the necklace over and switching the two colors. A66313

a(n) = 11 + floor(∑_j-1..n-1 a(j)/4). A120168

Number of integers i in range [A000302(n-1)..A024036(n)] of permutation A163355/A163356 with A163915(i)=i, but not A163355(i)=i. A163913

Triangle of coefficients of polynomials u(n,x) jointly generated with A210861; see the Formula section of A210861. A210860

Number of 0..12 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171318

Number of 0..n-1 integer arrays v[1..4] of length 4 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..3. A171355

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n·k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph. A367304