Properties of the Number 7084

Seven Thousand Eighty-Four

Basics

Value: 7083 → 7084 → 7085

Parity: even

Prime: No

Previous Prime: 7079

Next Prime: 7103

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 7 × 11 × 23

Divisors: 1, 2, 4, 7, 11, 14, 22, 23, 28, 44

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1101110101100

Octal: 15654

Duodecimal: 4124

Hexadecimal: 1bac

Square: 50183056

Square Root: 84.16650165000326

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

Number of dissections of a polygon: binomial(4·n, n)/(3·n + 1). A2293

Array read by antidiagonals giving number of paths up and left from (0,0) to (n,kn) where x/y <= k for all intermediate points. A70914

A triangle (lower triangular matrix) composed of Pfaff-Fuss (or Raney) sequences. A62993

Triangle T(n,m) read by rows: let p(n,x) = exp(-x) * ∑_{m >= 0} (2·m + 1)ⁿ * x^m/m!; then T(n,m) = [x^m] p(n,x). A154537

Number of (directed) Hamiltonian paths in the n-ladder graph. A137882

Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains k labels, n>=0, 0<=k<=n. A143398

Let m = number of ways of partitioning n into parts using all the parts of a subset of {1, 2, ..., n-1} whose sum of all parts of a subset is less than n; a(n) gives number of different subsets of {1, 2, ..., n-1} whose m is 0. A88528

Number of necklaces with 6 black beads and n-6 white beads. A32191

a(3n+k) = (k+1)*binomial(4n+k, n)/(3n+k+1), where k is n reduced mod 3. A124753

a(n) = n*(n+5)*(n+6)*(n+7)/24. A5587