Properties of the Number 26552

Twenty-Six Thousand Five Hundred Fifty-Two

Basics

Value: 26551 → 26552 → 26553

Parity: even

Prime: No

Previous Prime: 26539

Next Prime: 26557

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 3319

Divisors: 1, 2, 4, 8, 3319, 6638, 13276, 26552

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011110111000

Octal: 63670

Duodecimal: 13448

Hexadecimal: 67b8

Square: 705008704

Square Root: 162.94784441654943

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

T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..1 order. A223012

Gray code of Fibonacci(n). A255919

Number of (n+1) X (n+1) -3..3 symmetric matrices with every 2 X 2 subblock having sum zero and three distinct values. A211323

Number of 3Xn 0..1 arrays with no more than floor(3Xn/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..1 order. A223014

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

Irregular triangular array T read by rows: T(n, 0) = T(n, 2·n) = 1, T(n, 1) = T(n, 2·n-1) = floor(n/2 + 1), for even n >= 2, T(n, k) = T(n-1, k-2) + T(n-1, k-1) + T(n-1, k), otherwise T(n, k) = T(n-1, k-2) + T(n-1, k). A26552

Irregular triangle T, read by rows, in which row n lists the primes p <= n such that 2n-p is also prime. A184995

Number of nX4 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 2,2,1,1,1 for x=0,1,2,3,4. A197541

Number of (n+1)X2 0..7 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively. A204332