Properties of the Number -51298

Fifty-One Thousand Two Hundred Ninety-Eight

Basics

Value: -51299 → -51298 → -51297

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 13 × 1973

Divisors: 1, 2, 13, 26, 1973, 3946, 25649, 51298

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1100100001100010

Octal: -144142

Duodecimal: -2582A

Hexadecimal: -c862

Square: 2631484804

Square Root: 226.49061790723252

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)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A318098

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 105", based on the 5-celled von Neumann neighborhood. A285827

Number of nX3 0..1 arrays with every element unequal to 1, 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A318093

A new general triangle sequence based on the Eulerian form in three parts:m=1; t0(n,k)=If[n·k == 0, 1, Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)ⁿ, {j, 0, k + 1}]] t(n,k,m)=If[n == 0, 1, ( m*(n - k) + 1)*t0(n - 1 + 1, k - 1) + (m·k + 1)*t0(n - 1 + 1, k) + m·k*(n - k)*t0(n - 2 + 1, k - 1)]. A157177