Properties of the Number -21496

Twenty-One Thousand Four Hundred Ninety-Six

Basics

Value: -21497 → -21496 → -21495

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 2687

Divisors: 1, 2, 4, 8, 2687, 5374, 10748, 21496

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101001111111000

Octal: -51770

Duodecimal: -10534

Hexadecimal: -53f8

Square: 462078016

Square Root: 146.61514246489003

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

Number of compositions of n with no part circularly followed by a divisor or a multiple. A328599

Expansion of g.f. A(x,y) satisfying 0 = ∑_n=-oo..+oo xⁿ * A(x,y)ⁿ * (y - x^n-1)ⁿ⁺¹, as a triangle of coefficients T(n,k) of xⁿ*y^k in A(x,y), read by rows n >= 0. A366730

Least k>1 such that p^k - p^k-1 - 1 is prime for p = prime(n). A122396

Number of partitions of n containing the number of distinct parts as a part. A239945

Triangle read by rows: coefficients ξ(n,k) arising from the study of completely transitive graphs on n nodes. A259971

The number of connected weighted cubic graphs with weight n on 6 vertices. A321306

Certain subgraphs of a directed graph. A5330

Number of disconnected labeled digraphs with n nodes. A54593

Numbers n such that gcd(n, φ(n)) = gcd(φ(n), σ(n)) = gcd(σ(n), n) = τ(n). A217301

Expansion of exp(tan(x)/exp(x)). A9255