Properties of the Number -13022

Thirteen Thousand Twenty-Two

Basics

Value: -13023 → -13022 → -13021

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 17 × 383

Divisors: 1, 2, 17, 34, 383, 766, 6511, 13022

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11001011011110

Octal: -31336

Duodecimal: -7652

Hexadecimal: -32de

Square: 169572484

Square Root: 114.11397810960759

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 whose sum of divisors is a fourth power. A19422

a(0) = a(1) = 0, a(2) = 1; a(n) = a(n-1) + ∑_k=0..n-3 a(k) * a(n-k-3). A357308

a(n) = floor(47*(n-3/2)^3/2). A50256

a(n) = (7-(-5)ⁿ)/6. A166122

Number of n-node unlabeled rooted trees with thickening limbs and root outdegree (branching factor) 8. A245148

G.f. A(x) satisfies A(x) = 1 / ((1 + x) * (1 - x * (1 + x) * A(x²))). A367716

Array read by antidiagonals: T(n,k) is the number of sets of k integer sided cuboids with distinct volumes that fill an n X n X n cube. A387121

a(n) is the number of subsets of {1, 2, ..., n} with product of all entries <= n² + n. A298880

a(n) = (n - 1) * ∑_k=2..n A000010(k). A385682

T(2n+1, n+1), T given by A026758. A26876