Properties of the Number -178630

One Hundred Seventy-Eight Thousand Six Hundred Thirty

Basics

Value: -178631 → -178630 → -178629

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 17863

Divisors: 1, 2, 5, 10, 17863, 35726, 89315, 178630

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -101011100111000110

Octal: -534706

Duodecimal: -8745A

Hexadecimal: -2b9c6

Square: 31908676900

Square Root: 422.6464243312606

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 (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j³*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i³*x(i,j), i=1..n+1} nondecreasing. A232860

Form a triangle with n numbers in top row; all other numbers are the sum of their parents. E.g.: 4 1 2 7; 5 3 9; 8 12; 20. The numbers must be positive and distinct and the final number is to be minimized. Sequence gives final number. A28307

Number of (n+1)X(4+1) 0..1 arrays x(i,j) with row sums sum{j³*x(i,j), j=1..4+1} nondecreasing, and column sums sum{i³*x(i,j), i=1..n+1} nondecreasing. A232857

Number of (n+1)X(5+1) 0..1 arrays x(i,j) with row sums sum{j³*x(i,j), j=1..5+1} nondecreasing, and column sums sum{i³*x(i,j), i=1..n+1} nondecreasing. A232858