Properties of the Number 28268

Twenty-Eight Thousand Two Hundred Sixty-Eight

Basics

Value: 28267 → 28268 → 28269

Parity: even

Prime: No

Previous Prime: 28229

Next Prime: 28277

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 37 × 191

Divisors: 1, 2, 4, 37, 74, 148, 191, 382, 764, 7067

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110111001101100

Octal: 67154

Duodecimal: 14438

Hexadecimal: 6e6c

Square: 799079824

Square Root: 168.13090138341613

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

a(n) is the number whose binary representation is the concatenation of the divisors of n written in base 2. A182622

Sum of the lengths of the longest increasing subsequence over all 321-avoiding permutations of [n]. A132889

Number of n X 4 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 1,3,2,4,0 for x=0,1,2,3,4. A196918

a(n) = ∑_k=1..n Stirling2(n,k) * (k-1)! * φ(k), where φ = A000010. A330444

prime(n)*( prime(n)-n ). A161522

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 1,3,2,4,0 for x=0,1,2,3,4. A196922

Number of (n+1)X4 0..2 arrays containing all values 0..2 with every 2X2 subblock having two distinct values, and new values 0..2 introduced in row major order. A210047

Smallest composite integer in base n which remains composite after altering any one or two digits. A220289

Distinct odd elements in 3-Pascal triangle A028262 (by row). A28268