Properties of the Number -14582

Fourteen Thousand Five Hundred Eighty-Two

Basics

Value: -14583 → -14582 → -14581

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 23 × 317

Divisors: 1, 2, 23, 46, 317, 634, 7291, 14582

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11100011110110

Octal: -34366

Duodecimal: -8532

Hexadecimal: -38f6

Square: 212634724

Square Root: 120.75595223424807

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 n such that Bernoulli number B_n has denominator 282. A272184

Number of partitions where no part is a multiple of 9. A104502

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4. A196300

5-untouchable numbers. A284187

a(0) = 1, a(n) = 20·n² + 2 for n>0. A10010

Coefficient of s(2n) in s(n,n) * s(n,n) * s(n,n) * s(n,n) * s(n,n) * s(n,n), where s(n,n) is the Schur function indexed by two parts of size n, s(2n) is the Schur function corresponding to the trivial representation and·represents the inner or Kronecker product. A82424

MM-numbers of capturing, non-nesting multiset partitions (with empty parts allowed). A326260

a(n) = ∑_k=0..n 2^k * 5^n-k * Stirling2(n,k). A390889

a(n) = A027170(2n-1, n-1). A27175

Number of n X 2 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4. A196294