Properties of the Number -3337

Three Hundred Thirty-Seven

Basics

Value: -3338 → -3337 → -3336

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 47 × 71

Divisors: 1, 47, 71, 3337

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110100001001

Octal: -6411

Duodecimal: -1B21

Hexadecimal: -d09

Square: 11135569

Square Root: 57.766772456144714

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

Matrix inverse of triangle A121335, where A121335(n,k) = C( n*(n+1)/2 + n-k + 1, n-k) for n>=k>=0. A121440

a(n) = ∑_{k=0..floor(n/2)} (-1)^k * (n-k)!/(n-2·k)!. A358603

Second pentagonal numbers: a(n) = n*(3·n + 1)/2. A5449

Composite and every divisor (except 1) contains the digit 7. A62676

Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton (see Comments for precise definition). A160118

Second pentagonal numbers with odd index: a(n) = (2·n-1)*(3·n-1). A33568

a(n) = ∑_k=0..n C(n,k)*S2(n,k). Binomial convolution of the Stirling numbers of the 2nd kind. Also sum of the rows of A122454. A122455

Triangle read by rows: T(n,k) gives the number of ballot sequences of length n having exactly k descents, n>=0, 0<=k<=n. A238121

Irregular triangle read by rows: T(n,k) gives the number of ballot sequences of length n having k descents, n>=0, 0<=k<=A083920(n-1). A238122

Odd interprimes not divisible by 3. A72573