Properties of the Number 6880

Six Thousand Eight Hundred Eighty

Basics

Value: 6879 → 6880 → 6881

Parity: even

Prime: No

Previous Prime: 6871

Next Prime: 6883

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 5 × 43

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 32, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101011100000

Octal: 15340

Duodecimal: 3B94

Hexadecimal: 1ae0

Square: 47334400

Square Root: 82.94576541331088

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: Yes

Taxicab Number: No

Super Prime: No

Friedman Number: Yes

Fermat Number: No

Cullen Number: No

OEIS Sequences

Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(3,n) (with n at least 4) missing three edges, where exactly two removed edges are incident to the same vertex in the 3-point set and exactly two removed edges are incident to the same vertex in the other set. A343372

Number of outcomes of unlabeled n-team round-robin tournaments. A568

Vampire numbers (definition 2): numbers n with an even number of digits which have a factorization n = i·j where i and j have the same number of digits and the multiset of the digits of n coincides with the multiset of the digits of i and j. A14575

Coefficients of the '3rd-order' mock θ function ω(q). A53253

Triangle read by rows: T(n,k) = number of edges in a "frame" of size n X k (see Comments in A331457 for definition). A332600

Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits. A20342

Numbers k such that k² is palindromic in base 7. A29992

Products of the 5th power of a prime and 2 distinct primes (p⁵*q·r). A179667

T(n,k)=1/36 the number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock containing two of one value, two of another, and five of the last. A184457

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 grid such that the picked positions have a line symmetry. A291718