Properties of the Number 26493

Twenty-Six Thousand Four Hundred Ninety-Three

Basics

Value: 26492 → 26493 → 26494

Parity: odd

Prime: No

Previous Prime: 26489

Next Prime: 26497

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 8831

Divisors: 1, 3, 8831, 26493

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110011101111101

Octal: 63575

Duodecimal: 133B9

Hexadecimal: 677d

Square: 701879049

Square Root: 162.76670421188726

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

Composite numbers whose concatenation of their aliquot parts, in ascending order, is a palindrome. A249300

Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1. A45

Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!). A108

Motzkin numbers: number of ways of drawing any number of nonintersecting chords joining n (labeled) points on a circle. A1006

Large Schröder numbers (or large Schroeder numbers, or big Schroeder numbers). A6318

Schroeder's second problem (generalized parentheses); also called super-Catalan numbers or little Schroeder numbers. A1003

Central Delannoy numbers: a(n) = ∑_k=0..n C(n,k)*C(n+k,k). A1850

Riordan numbers: a(n) = (n-1)*(2·a(n-1) + 3·a(n-2))/(n+1). A5043

a(n) = 3·a(n-1) + a(n-2), with a(0)=0, a(1)=1. A6190

Euler (or secant) numbers E(n). A122045