Properties of the Number -13150

Thirteen Thousand One Hundred Fifty

Basics

Value: -13151 → -13150 → -13149

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 ² × 263

Divisors: 1, 2, 5, 10, 25, 50, 263, 526, 1315, 2630

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11001101011110

Octal: -31536

Duodecimal: -773A

Hexadecimal: -335e

Square: 172922500

Square Root: 114.67344941179715

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) = ∑_k>=0 x^k * (1+x)^k*(k+1/2). A121690

a(n) = ∑_{k=0..floor(n/4)} binomial(n-1-3·k,k) * binomial(2·n-8·k,n-4·k). A360292

Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n having k DD's (0 <= k <= n-1 for n >= 1). A128738

Triangle, read by rows, T(n, k) = binomial(n, k) for n < 2 and binomial(n, k) + 3^n-1*binomial(n-2, k -1) otherwise. A146987

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) - n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296557

Total number of blocks in all set partitions of strict integer partitions of n. A330765

The number of days elapsed since the Gregorian (proleptic) date Sunday, December 31, 1 BC on 1/1/n, where 1/1/n is the Gregorian date in the format month/day/year, the New Year's Day of the year n. A350471

From a nim-like game. A3412

a(n) = (1/6)*(n+1)*(10·n² + 17·n + 12). A102296

Number of skew Dyck paths of semilength n having no DD's. A128739