Properties of the Number -112504

One Hundred Twelve Thousand Five Hundred Four

Basics

Value: -112505 → -112504 → -112503

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 7 ³ × 41

Divisors: 1, 2, 4, 7, 8, 14, 28, 41, 49, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11011011101111000

Octal: -333570

Duodecimal: -55134

Hexadecimal: -1b778

Square: 12657150016

Square Root: 335.4161594199063

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 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235186

G.f. = b(2)*b(4)*b(6)/(x⁸+x⁷-x³-x²-x+1), where b(k) = (1-x^k)/(1-x). A266375

Consider primitive solutions (x,y,z) to the system x+y+z = r², x²+y²+z² = s², x³+y³+z³ = t², with 0<x<=y<=z arranged in order of increasing z; sequence gives y values. A327339

Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235179