Properties of the Number -144512

One Hundred Forty-Four Thousand Five Hundred Twelve

Basics

Value: -144513 → -144512 → -144511

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁷ × 1129

Divisors: 1, 2, 4, 8, 16, 32, 64, 128, 1129, 2258

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100011010010000000

Octal: -432200

Duodecimal: -6B768

Hexadecimal: -23480

Square: 20883718144

Square Root: 380.1473398565351

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

T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234658

Exponential-convolution of triangular numbers with themselves. A7465

Let M be the 3 X 3 matrix [ 6 0 -8 / 1 0 0 / 0 1 0]. Then Mⁿ * [1 1 1] = [a(n-1), a(n), a(n+1)]. A94254

Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n, having k (1,1)-steps on the lines y=x, y=x+1 and y=x-1. A110183

Number of (n+1) X (2+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234652

Number of (n+1) X (5+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234655