Properties of the Number -129129

One Hundred Twenty-Nine Thousand One Hundred Twenty-Nine

Basics

Value: -129130 → -129129 → -129128

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 11 × 13 × 43

Divisors: 1, 3, 7, 11, 13, 21, 33, 39, 43, 77

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11111100001101001

Octal: -374151

Duodecimal: -62889

Hexadecimal: -1f869

Square: 16674298641

Square Root: 359.34523789804143

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

Triangle of coefficients, read by rows, where T(n,k) is the coefficient of xⁿ*y^k in f(x,y) that satisfies f(x,y) = (1+x) - x²*(1+x)³ + xy·f(x,y)³. A86634

Number T(n,k) of 2n-length strings of balanced parentheses of exactly k different types that are introduced in ascending order; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A253180

T(n,k)=Number of nXk binary arrays with row sums nondecreasing and columns lexicographically nondecreasing. A267245

Lucky numbers that are concatenations of a number k with itself. A32650

Odd numbers divisible by the palindromic sum of their prime factors (counted with multiplicity). A46359

Number of 2n-length strings of balanced parentheses of exactly 3 different types that are introduced in ascending order. A258391

Number of nX4 binary arrays with row sums nondecreasing and columns lexicographically nondecreasing. A267241

Expansion of e.g.f. exp(x⁵/120·cosh(x)). A389242

Number of 7Xn binary arrays with row sums nondecreasing and columns lexicographically nondecreasing. A267250