Properties of the Number -9956

Nine Hundred Fifty-Six

Basics

Value: -9957 → -9956 → -9955

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 19 × 131

Divisors: 1, 2, 4, 19, 38, 76, 131, 262, 524, 2489

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10011011100100

Octal: -23344

Duodecimal: -5918

Hexadecimal: -26e4

Square: 99121936

Square Root: 99.77975746613137

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

G.f. A(x) satisfies: (1 + x)/(1 - x) = A(x)*A(x²)²*A(x³)³*A(x⁴)⁴* ... *A(x^k)^k* ... A307659

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250797

Triangle T(n,k) = T(n-1, k) + T(n-1, k-1) + 7·T(n-2, k-1), read by rows. A153520

a(n) = 1·2*3 + 4·5*6 + 7·8*9 + 10·11·12 + 13·14·15 + 16·17·18 + ... + (up to n). A319014

Number of sums S of distinct positive integers satisfying S <= n. A26906

Number of length n+2 0..1 arrays with at most one downstep in every n consecutive neighbor pairs. A255993

Expansion of ∏_k>=0 1/(1-x^5·k+1)^5·k+1. A285049

"DHK" (bracelet, identity, unlabeled) transform of 2,1,1,1,... A32252

Number of multiset repetition class defining partitions of N with 1<=N<=n. A185976

String n is at position n in decimal digits of golden ratio (φ). A117431