Properties of the Number 28445

Twenty-Eight Thousand Four Hundred Forty-Five

Basics

Value: 28444 → 28445 → 28446

Parity: odd

Prime: No

Previous Prime: 28439

Next Prime: 28447

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 5689

Divisors: 1, 5, 5689, 28445

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110111100011101

Octal: 67435

Duodecimal: 14565

Hexadecimal: 6f1d

Square: 809118025

Square Root: 168.65645555388622

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

Apply partial sum operator thrice to Fibonacci numbers. A14162

a(n) = T(2n+1, n+2), T given by A027935. A27942

Expansion of -x*(1-x)/(1+14·x+x²)³. A122575

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, 0, 1), (1, -1, 0), (1, 1, 1)}. A150455

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, 0), (1, 0, -1), (1, 1, 1)}. A150456

a(0) = A002858(1) = 1, followed by the greatest Ulam numbers A002858 to form a complete sequence (see algorithm below). A348413

Number of cubefree words of length n on two letters. A28445

a(n) = smallest k >= 0 for which there is a sequence n = b₁ < b₂ < ... < b_t = n + k such that b₁ + b₂ +...+ b_t is a perfect square. A277516

Lexicographically earliest sequence of terms describing its successive chunks of different digits. A323421