Properties of the Number -21468

Twenty-One Thousand Four Hundred Sixty-Eight

Basics

Value: -21469 → -21468 → -21467

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 1789

Divisors: 1, 2, 3, 4, 6, 12, 1789, 3578, 5367, 7156

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101001111011100

Octal: -51734

Duodecimal: -10510

Hexadecimal: -53dc

Square: 460875024

Square Root: 146.5196232591389

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

Triangle T(n,k) with the coefficient [x^k] of the characteristic polynomial of the following n X n triangular matrix: 4 on the main diagonal, -1 of the two adjacent subdiagonals, 0 otherwise. A124029

Triangle A124029 with the (0,0) entry replaced by 4. A123966

Riordan array (1/(1+4x+x²), x/(1+4x+x²)). A159764

Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of·in increasing order). A207823

Triangle T(n,k) of the numbers of nodes in all non-extendable (complete) non-self-adjacent simple paths within a square lattice bounded by rectangles with nodal dimensions n and k, n >= k >= 2. A214397

Sum over all partitions of n of the number of distinct parts i of multiplicity i+1. A276434

G.f.: ∑_n>=0 (n+1) * xⁿ * (1 + xⁿ)ⁿ. A326002

Square array of coefficients of binomial polynomials, read by antidiagonals. A80959

∑_1<=k<n gcd(k!,n!/k!). A14454

Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0. A96554