Properties of the Number 6716

Six Thousand Seven Hundred Sixteen

Basics

Value: 6715 → 6716 → 6717

Parity: even

Prime: No

Previous Prime: 6709

Next Prime: 6719

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 23 × 73

Divisors: 1, 2, 4, 23, 46, 73, 92, 146, 292, 1679

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101000111100

Octal: 15074

Duodecimal: 3A78

Hexadecimal: 1a3c

Square: 45104656

Square Root: 81.95120499419151

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

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

Number T(n,k) of solid standard Young tableaux of n cells and height = k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A214753

a(1) = 1, a(n+1) is the sum of a(n) and floor( arithmetic mean of a(1) ... a(n) ). A65094

Scan decimal expansion of π until all n-digit strings have been seen; a(n) is last string seen. A32510

Sum of the second largest parts of the partitions of n into 9 parts. A326472

T(n,k)=Number of nXk nonnegative integer arrays with upper left 0 and every value within 2 of its city block distance from the upper left and every value increasing by 0 or 1 with every step right or down. A252820

G.f.: ∑_n>=0 xⁿ * (xⁿ⁺¹ + i)ⁿ / (1 + i·xⁿ⁺¹)ⁿ⁺¹. A324300

G.f.: ∑_n>=0 xⁿ * (1 - xⁿ⁺¹)ⁿ / (1 + xⁿ⁺¹)ⁿ⁺¹. A323695

Number of hill-free Dyck paths of semilength n+2 and having length of first descent equal to 2 (a hill in a Dyck path is a peak at level 1). A118973

Triangle T(n,k) = 1 + A176304(k) + A176304(n-k) - A176304(n), read by rows. A176307