Properties of the Number -5673

Six Hundred Seventy-Three

Basics

Value: -5674 → -5673 → -5672

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 31 × 61

Divisors: 1, 3, 31, 61, 93, 183, 1891, 5673

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011000101001

Octal: -13051

Duodecimal: -3349

Hexadecimal: -1629

Square: 32182929

Square Root: 75.31932023060219

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 transform of the Catalan numbers with a simple Hankel transform. A157127

Values of n such that L(17) and N(17) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227520

G.f. satisfies: A(x) = A(x² - x³)/(1-x). A251659

Number of integer partitions of n with no adjacent parts having quotient >= 2. A342096

3 times hexagonal numbers: a(n) = 3·n*(2·n-1). A94159

T(n,k) is the number of n X n 0..k arrays with row and column sums equal. A202784

T(n,k)=Number of n X n 0..k symmetric arrays with every row summing to floor(n·k/2). A213800

Connell (3,2)-sum sequence (partial sums of the (3,2)-Connell sequence). A122794

T(n,k) = Number of n X k 0..2 arrays with row sums equal and column sums equal. A203564

Odd numbers k for which A348942(A064989(k)) = 1. A348943