Properties of the Number -20349

Twenty Thousand Three Hundred Forty-Nine

Basics

Value: -20350 → -20349 → -20348

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 17 × 19

Divisors: 1, 3, 7, 9, 17, 19, 21, 51, 57, 63

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100111101111101

Octal: -47575

Duodecimal: -B939

Hexadecimal: -4f7d

Square: 414081801

Square Root: 142.64992113562488

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 read by rows: T(0,0)=1; for n>=1 T(n,k) is the coefficient of x^k in the monic characteristic polynomial of the n X n band matrix with main diagonal 2,3,3,..., subdiagonal -3,-3,-3,..., sub-subdiagonal 1,1,1,... and superdiagonal -1,-1,-1,... (0<=k<=n). A124019

Binomial coefficients C(n,5). A389

Irregular triangle read by rows where T(n,k) is the number of labeled loop-graphs covering n vertices with k edges. A369199

Triangle of even numbered entries of odd numbered rows of Pascal's triangle A007318. A91042

a(n) = (4n+1)*binomial(4n,n)/(3n+1). A52203

Triangle read by rows: T(n,k) = C( C(n,2), k) for n >= 0, 0 <= k <= C(n,2). A84546

4-dimensional figurate numbers: a(n) = (5·n-1)*binomial(n+2,3)/4. A2418

Numbers k such that k and k+1 have 4 distinct prime factors. A140078

Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2). A62734

Numbers k such that k and k + 1 are both Niven numbers in base 3/2 (A342426). A342427