Properties of the Number -13654

Thirteen Thousand Six Hundred Fifty-Four

Basics

Value: -13655 → -13654 → -13653

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 6827

Divisors: 1, 2, 6827, 13654

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11010101010110

Octal: -32526

Duodecimal: -7A9A

Hexadecimal: -3556

Square: 186431716

Square Root: 116.8503316212667

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

Inverse binomial transform of a math magic problem. A84214

T(n,k) is the number of (n+1) X (k+1) 0..3 matrices with each 2 X 2 permanent equal. A224975

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 2 and no antidiagonal sum 2 and no row sum 0 and no column sum 0. A255792

Dispersion of A016825 (4k+2, k>0), by antidiagonals. A191668

a(n) is the number of initial persons such that the n-th person survives in the duck-duck-goose game. A182459

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 403", based on the 5-celled von Neumann neighborhood. A281847

Number of alternating sign 2n+1 X 2n+1 matrices invariant under all symmetries of the square. A5164

a(n) = (10·2ⁿ + 2*(-1)ⁿ)/3 for n > 0; a(0) = 1. A168648

Triangle T(n, k) = binomial(2·n, n) + binomial(n, k)², read by rows. A157531

a(n) = (10·2ⁿ + 3 - (-1)ⁿ)/6. A171231