Properties of the Number 26421

Twenty-Six Thousand Four Hundred Twenty-One

Basics

Value: 26420 → 26421 → 26422

Parity: odd

Prime: No

Previous Prime: 26417

Next Prime: 26423

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 8807

Divisors: 1, 3, 8807, 26421

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110011100110101

Octal: 63465

Duodecimal: 13359

Hexadecimal: 6735

Square: 698069241

Square Root: 162.5453782794208

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

Sum T(n,k) of the entries in the k-th blocks of all set partitions of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A285362

Sum of the entries in the fourth blocks of all set partitions of [n]. A285366

Number of ways to choose disjoint strict rooted partitions of each part in a strict rooted partition of n. A301756

Numbers k such that [prime(k), prime(k+1), prime(k+2)] = [1, 2, 3] mod 11. A302767

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence). A25113

a(n) is the least number whose sum of digits in primorial base equals n. A343048

The minimal number of steps to return to the origin for a self-avoiding walk with step-length n on a 2D plane where at each step the walk must go to an unvisited point with integer coordinates as close as possible to the origin. A309500

a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<j<=n, with initial terms 3,4. A26421