Properties of the Number -21476

Twenty-One Thousand Four Hundred Seventy-Six

Basics

Value: -21477 → -21476 → -21475

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 7 × 13 × 59

Divisors: 1, 2, 4, 7, 13, 14, 26, 28, 52, 59

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101001111100100

Octal: -51744

Duodecimal: -10518

Hexadecimal: -53e4

Square: 461218576

Square Root: 146.54692081377897

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

Numbers that are the sum of 11 positive 8th powers. A3389

Number of labeled mating graphs with n nodes. Also called point-determining graphs. A6024

Longest edge a of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a² + b²), sqrt(b² + c²), sqrt(a² + c²) are integers). A31173

a(n) = ∑_k=0..n (-1)^n-k * binomial(5·k,k) / (4·k + 1). A346681

G.f.: A(x) = ∏_n>=1 1/(1 - 4ⁿ*xⁿ)^2/4ⁿ; self-convolution equals A110154. A110156

Number of compositions (ordered partitions) of n into distinct parts, the least being 6. A339169

a(n) = (1/2)*A291730(n). A291731

Number of simple graphs on n unlabeled nodes with maximum degree exactly 2. A324740

Inverse Euler transform of A003480. A141312

Numbers·such that σ(x) + σ(R(x)) = σ(x + R(x)), where R(x) is the digit reversal of·and σ(x) is the sum of the divisors of x. A246487