Properties of the Number -26451

Twenty-Six Thousand Four Hundred Fifty-One

Basics

Value: -26452 → -26451 → -26450

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 2939

Divisors: 1, 3, 9, 2939, 8817, 26451

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110011101010011

Octal: -63523

Duodecimal: -13383

Hexadecimal: -6753

Square: 699655401

Square Root: 162.6376340211576

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 permutations of 0..floor((n·k-1)/2) on even squares of an nXk array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing. A215788

T(n,k) = Number of permutations of 0..floor((n·k-2)/2) on odd squares of an n X k array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing. A215870

Partial sums of A001935; at one time this was conjectured to agree with A007478. A14605

a(n) = 50·n² + 1. A157916

Number of compositions of n into distinct parts such that the difference between adjacent parts is at least two. A328222

Number of increasing sequences of n integers x(1),...,x(n) with values in 1..5·n such that x(j) divides x(k) iff j divides k. A180382

Number of permutations of 0..floor((n·8-1)/2) on even squares of an nX8 array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing. A215786

Number of permutations of 0..floor((n·8-2)/2) on odd squares of an nX8 array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing. A215868

Number of permutations of 0..floor((5·n-1)/2) on even squares of an 5·n array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing. A215791

Number of permutations of 0..floor((5·n-2)/2) on odd squares of an 5Xn array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing. A215873