Properties of the Number 6044

Six Thousand Forty-Four

Basics

Value: 6043 → 6044 → 6045

Parity: even

Prime: No

Previous Prime: 6043

Next Prime: 6047

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 1511

Divisors: 1, 2, 4, 1511, 3022, 6044

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110011100

Octal: 13634

Duodecimal: 35B8

Hexadecimal: 179c

Square: 36529936

Square Root: 77.74316690230724

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..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00001011. A260284

Triangle T(n, k) = Number of non-equivalent (mod D₄) ways to arrange k indistinguishable points on an n X n square grid so that no three of them are collinear. Triangle read by rows. A235453

Triangle read by rows: T(n,k) = number of nonequivalent dissections of an n-gon into k polygons by nonintersecting diagonals up to rotation and reflection. A295634

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3 or 4 king-move adjacent elements, with upper left element zero. A297915

Sum of the smallest parts in the partitions of n into 8 parts. A308990

Numbers n such that A062234(n) = A062234(n+1) = A062234(n+2). A258449

Number of nonequivalent dissections of an n-gon into n-4 polygons by nonintersecting diagonals up to rotation and reflection. A3450

Number of non-equivalent (mod D₄) ways to arrange 4 points on an n X n square grid so that no three points are collinear. A235455

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) + 1, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A295953

a(n) = S3(n,2), where S3(n, t) = ∑_k=0..n k^t *(∑_j=0..k binomial(n,j))³. A89670