Properties of the Number -10871

Ten Thousand Eight Hundred Seventy-One

Basics

Value: -10872 → -10871 → -10870

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 7 × 1553

Divisors: 1, 7, 1553, 10871

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10101001110111

Octal: -25167

Duodecimal: -635B

Hexadecimal: -2a77

Square: 118178641

Square Root: 104.26408777714406

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 T(n,k) of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value of k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A258829

T(n,k)=Number of nXk binary arrays without the pattern 0 0 1 antidiagonally or horizontally. A188992

a(n) is the number of conjugacy classes in the alternating group A_n. A702

Triangle of a(n,k) = number of minimal covers of an n-set that cover k points of that set uniquely (n >= 1, k >= 1). A35347

Record entries in A065191. A65192

Numbers n such that 30n+{11, 13, 17, 19, 23} are 5 consecutive primes. A182279

Record high points in A336957. A337646

Triangular array read by rows. T(n,k) is the number of minimal covers of an n-set with exactly k points that are in more than one set of the cover, n>=0, 0<=k<=max(0,n-2). A282575

Number of minimal covers of an n-set that have exactly one point which appears in more than one set in the cover. A3466

Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime. A245208