Properties of the Number 5798

Five Thousand Seven Hundred Ninety-Eight

Basics

Value: 5797 → 5798 → 5799

Parity: even

Prime: No

Previous Prime: 5791

Next Prime: 5801

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 × 13 × 223

Divisors: 1, 2, 13, 26, 223, 446, 2899, 5798

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011010100110

Octal: 13246

Duodecimal: 3432

Hexadecimal: 16a6

Square: 33616804

Square Root: 76.14459928320589

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

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

G.f. A(x) satisfies A(x) = 1 + x·A(x)/(1 - x·A(x)²). A106228

Expansion of (1 + x - sqrt(1 - 2·x - 3·x²)) / 2 in powers of x. A86246

A Motzkin triangle: a(n,k), n >= 2, 2 <= k <= n, = number of complete, strictly subdiagonal staircase functions. A20474

Number T(n,k) of isoscent sequences of length n with exactly k descents; triangle T(n,k), n>=0, 0<=k<=n+2-ceiling(2·sqrt(n+1)), read by rows. A242352

Number of 2 X 2 singular integer matrices with elements from {1,...,n}. A134506

Table where the entry (n,k) (n >= 0, k >= 0) gives number of Motzkin paths of the length n with the minimum peak width of k. A64645

T(n,k) = Number of length n+1 nonnegative integer arrays starting and ending with 0 with adjacent elements differing by no more than k. A204213

Bisection of Motzkin numbers A001006. A99250

G.f. A(x) satisfies: A(x) = A(x² - x³)/x. A273218