Properties of the Number 28498

Twenty-Eight Thousand Four Hundred Ninety-Eight

Basics

Value: 28497 → 28498 → 28499

Parity: even

Prime: No

Previous Prime: 28493

Next Prime: 28499

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 × 14249

Divisors: 1, 2, 14249, 28498

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110111101010010

Octal: 67522

Duodecimal: 145AA

Hexadecimal: 6f52

Square: 812136004

Square Root: 168.81350656863924

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 nXk 0..3 arrays with each element equal to either the sum mod 4 of its horizontal and vertical neighbors or the sum mod 4 of its diagonal and antidiagonal neighbors. A183541

Triangle, read by rows, such that the initial terms of the binomial transform of the n-th row forms the n-th row of triangle A059438 transposed (permutations of [1..n] with k components). A91063

Number of nX3 0..3 arrays with each element equal to either the sum mod 4 of its horizontal and vertical neighbors or the sum mod 4 of its diagonal and antidiagonal neighbors. A183537

G.f.: A(x) = 1+x*(1+x*(1+x*(...(1+x*(...)ⁿ)...)³)²)¹. A95793

Number of 8-length words w over n-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z. A213287

Let [n] = {0,...,n-1}; a(n) is number of functions f:[n] -> [n] for which there exists an injection g:[n] -> [n+1] such that for j with 0 <= j < n, either g(j) = f(j) or g(j) = f(j)+1. A28498