Properties of the Number -142129

One Hundred Forty-Two Thousand One Hundred Twenty-Nine

Basics

Value: -142130 → -142129 → -142128

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 ² × 29 ²

Divisors: 1, 13, 29, 169, 377, 841, 4901, 10933, 142129

Polygonal

Triangular: No

Square: Yes

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100010101100110001

Octal: -425461

Duodecimal: -6A301

Hexadecimal: -22b31

Square: 20200652641

Square Root: 377

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

Squared Fibonacci numbers: a(n) = F(n)² where F = A000045. A7598

a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = a(1) = a(2) = 1, a(3) = 2. A6498

Partial sums of A001654, or sum of the areas of the first n Fibonacci rectangles. A64831

a(n) = Fibonacci(2n)². A49684

Number of n X 1 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 2,0,1,3,4 for x=0,1,2,3,4. A195971

Antidiagonal sums of triangle A035317. A80239

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,2 or 2,2. A264017

T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, diagonal or antidiagonal neighbor. A221245

Positive values of k such that there is exactly one permutation p of (1,2,3,...,k) such that i+p(i) is a Fibonacci number for 1<=i<=k. A97083

MM-numbers of labeled multigraphs spanning an initial interval of positive integers. A320459