Properties of the Number 6955

Six Thousand Nine Hundred Fifty-Five

Basics

Value: 6954 → 6955 → 6956

Parity: odd

Prime: No

Previous Prime: 6949

Next Prime: 6959

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 × 13 × 107

Divisors: 1, 5, 13, 65, 107, 535, 1391, 6955

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101100101011

Octal: 15453

Duodecimal: 4037

Hexadecimal: 1b2b

Square: 48372025

Square Root: 83.3966426182733

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

T(n,k)=Number of nXk 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. A281563

Number of subsets of {1..n} containing no sums or products of pairs of elements. A326495

At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage. A64412

Number of partitions of n such that the number of even parts is a part and the number of odd parts is a part. A240575

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero. A306060

Number of semistandard rectangular plane partitions of n. A323432

O.g.f. satisfies A²(z) = 1/(1 - z)*( BINOMIAL(BINOMIAL(A(z))) ). A258377

Coefficients of numerator of recursively defined rational function: p(x,3)=x*(x² + 6·x + 1)/(1 - x)⁴; p(x, n) = 2·x*D[p(x, n - 1), x] - p(x,n-2). A166349

Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1, 3), (5, 9), (7, 13), (11, 19), (15, 25), (17, 29), (21, 35), (23, 39), (27, 45), ... This is the sequence of the product of the members of pairs. A75320

Number of compositions of n whose standard factorization into Lyndon words has all weakly increasing factors. A299026