Properties of the Number -3441

Four Hundred Forty-One

Basics

Value: -3442 → -3441 → -3440

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 31 × 37

Divisors: 1, 3, 31, 37, 93, 111, 1147, 3441

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110101110001

Octal: -6561

Duodecimal: -1BA9

Hexadecimal: -d71

Square: 11840481

Square Root: 58.66003750424986

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

Triangular sequence of coefficients from a polynomial recursion: p(x,n)=-2 (-(n - 1) + x)*p(x, n - 1) + (-(n + 1) + (n + 2)* x - x²)p(x, n - 2). A137663

Number of unimodal partitions/compositions of n into distinct terms. A72706

a(n) = n*(5·n+1)/2. A5475

Triangle read by rows: T(n,k) is the number of graphs with n vertices with edge connectivity k. A263296

Pinwheel numbers: a(n) = 2·n² + 6·n + 1. A59993

Number of partitions p of n such that (number of distinct parts of p) <= max(p) - min(p). A239955

Second 9-gonal (or nonagonal) numbers: a(n) = n*(7·n+5)/2. A179986

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 2 5 6 or 7. A252574

Number of compositions (ordered partitions) of n into tetrahedral (or triangular pyramidal) numbers (A000292). A282582

Number T(n,k) of linear chord diagrams having n chords and minimal chord length k (or k=0 if n=0); triangle T(n,k), n>=0, 0<=k<=n, read by rows. A293881