Properties of the Number 26536

Twenty-Six Thousand Five Hundred Thirty-Six

Basics

Value: 26535 → 26536 → 26537

Parity: even

Prime: No

Previous Prime: 26513

Next Prime: 26539

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 31 × 107

Divisors: 1, 2, 4, 8, 31, 62, 107, 124, 214, 248

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011110101000

Octal: 63650

Duodecimal: 13434

Hexadecimal: 67a8

Square: 704159296

Square Root: 162.8987415543779

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 prime(k) + prime(k+1) + prime(k+2) is a square. A76305

a(n) = (2·n³ - n² - n + 2)/2. A81441

E.g.f. satisfies A(x) = exp( x·A(x)/(1 - x·A(x)³) ). A365013

Numerators of continued fraction convergents to sqrt(477). A41910

a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 odd positive integers}. A24202

Number of n X 4 binary arrays without the pattern 0 1 diagonally or vertically. A188838

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

Increase in the number of fixed polyominoes from order n to order n+1. A283110

Irregular triangular array T read by rows: T(i,0 ) = T(i,2i) = 1 for i >= 0; T(i,1) = T(i,2i-1) = floor(i/2) for i >= 1; for even n >= 2, T(i,j) = T(i-1,j-2) + T(i-1,j-1) + T(i-1,j) for j = 2..2i-2, for odd n >= 3, T(i,j) = T(i-1,j-2) + T(i-1,j) for j = 2..2i-2. A26536

Numbers k(n) used for Cassels's Markoff forms MF(n) corresponding to the conjectured unique Markoff triples MT(n) with maximal entry m(n) = A002559(n), for n >= 1. A305310