Properties of the Number -3682

Six Hundred Eighty-Two

Basics

Value: -3683 → -3682 → -3681

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 7 × 263

Divisors: 1, 2, 7, 14, 263, 526, 1841, 3682

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111001100010

Octal: -7142

Duodecimal: -216A

Hexadecimal: -e62

Square: 13557124

Square Root: 60.67948582511226

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) = ∑_{k=0..floor(n/3)} (-1)^k * (n-2·k)!/(n-3·k)!. A358604

Expansion of (1 - t)*(1 + t)^x. A227342

a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n² + 5)/6. A4006

Expansion of 1/(1 - x³ - x⁵ - x⁷ + x¹⁰), inverse of a Salem polynomial. A143472

Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] ∏_m=1..n (x - m - r), with r = 7. A51379

Number of partitions of n with more odd parts than even parts. A108950

Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square array such that their adjacency graph consists of a single component. Two positions (s,t), (u,v) are considered as adjacent if max(abs(s-u), abs(t-v)) <= 1. A98485

Number of partitions of n where the difference between consecutive parts is at most 7. A238867

Noncongruent squarefree numbers n with A248395(n)/d(n) = -2, where d(n) = A000005(n). A248406

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n-1 <= 2^p+1, with a(1) = 1, a(2) = 3, and a(3) = 1. A49964