Properties of the Number 28474

Twenty-Eight Thousand Four Hundred Seventy-Four

Basics

Value: 28473 → 28474 → 28475

Parity: even

Prime: No

Previous Prime: 28463

Next Prime: 28477

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 23 × 619

Divisors: 1, 2, 23, 46, 619, 1238, 14237, 28474

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110111100111010

Octal: 67472

Duodecimal: 1458A

Hexadecimal: 6f3a

Square: 810768676

Square Root: 168.7424072365924

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

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order. A252882

Number of ways to choose a strict partition of each part of a strict composition of n. A336343

a(n) = a(n-1)+ceiling(a(n-2)/2) with a(0)=0, a(1)=1. A64323

a(n) = coefficient of xⁿ in the power series A(x) such that: 1 = ∑_n=-oo..+oo n·xⁿ * (1 - xⁿ)ⁿ * A(x)ⁿ. A357158

a(n) = a(n-1) + a(n-2) - floor(a(n-2)/2), starting 2,1. A173497

Number of Dumont permutations of the fourth kind of length 2n avoiding the pattern 312. A343795

Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..3 array extended with zeros and convolved with 1,-2,1. A222148

Number of (n+2)X(3+2) 0..2 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order. A252879

Number of (1+2)X(n+2) 0..2 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order. A252883

Number of perfect matchings in graph P₁₂ X P_n. A28474