Properties of the Number -2651

Six Hundred Fifty-One

Basics

Value: -2652 → -2651 → -2650

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 11 × 241

Divisors: 1, 11, 241, 2651

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -101001011011

Octal: -5133

Duodecimal: -164B

Hexadecimal: -a5b

Square: 7027801

Square Root: 51.487862647424

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

Expansion of ∏_m>=1 (1+q^m)^-5. A22600

Triangle T(n, k) = binomial(binomial(n, 2) + k, k) + binomial(binomial(n, 2) + n-k, n-k) - binomial(binomial(n, 2) + n, n), read by rows. A176567

a(n) = n + (n+1)². A28387

Number of n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951). A1522

Stella octangula numbers: a(n) = n*(2·n² - 1). A7588

Numbers k such that the geometric mean of φ(k) and σ(k) is an integer. A11257

Number of alternately co-strong integer partitions of n. A317256

Discriminants of imaginary quadratic fields with class number 26 (negated). A351664

a(n) = n*(11·n - 1)/2. A22268

T(n,k) = Number of (n+1) X (k+1) arrays of permutations of 0..(n+1)*(k+1)-1 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order. A263519