Properties of the Number 26546

Twenty-Six Thousand Five Hundred Forty-Six

Basics

Value: 26545 → 26546 → 26547

Parity: even

Prime: No

Previous Prime: 26539

Next Prime: 26557

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 13 × 1021

Divisors: 1, 2, 13, 26, 1021, 2042, 13273, 26546

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011110110010

Octal: 63662

Duodecimal: 13442

Hexadecimal: 67b2

Square: 704690116

Square Root: 162.92943257741985

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 T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square array such that their adjacency graph consists of a single component. Two positions (s,t), (u,v) are considered as adjacent if max(abs(s-u), abs(t-v)) <= 1. A98485

T(n,k) = Number of (n+3) X (k+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits. A262240

G.f.: ∑_n>=0 xⁿ * (xⁿ + i)ⁿ / (1 + i·xⁿ⁺¹)ⁿ⁺¹, where i² = -1. A323675

Triangle read by rows: T(m,n) is the label of the ending square of an (m,n)-leaper (a generalization of a chess knight) when it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square. A323750

a(n) = a(n-1) + a(n-2) - a(n-3) + a(n-5). A107368

Number of (n+3)X(3+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits. A262238

a(n) = position of n³ + (n+1)³ + (n+2)³ in A024975. A24980

Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 12. A31600

a(n) = T(2n-1,n-2), T given by A026536. A26546