Properties of the Number -162643

One Hundred Sixty-Two Thousand Six Hundred Forty-Three

Basics

Value: -162644 → -162643 → -162642

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 13 × 12511

Divisors: 1, 13, 12511, 162643

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -100111101101010011

Octal: -475523

Duodecimal: -7A157

Hexadecimal: -27b53

Square: 26452745449

Square Root: 403.2902180812225

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

Convolution of (shifted) A026671 with A000984 (central binomial coefficients of even order). A54441

a(n) = denominator of b(n): b(n) = the maximum possible value for a continued fraction whose terms are a permutation of the terms of the simple continued fraction for H(n) = sum{k=1 to n} 1/k, the n-th harmonic number. A129083

Sum along upward diagonal of Pascal triangle to center. A10752

Sum along upward diagonal of Pascal triangle up to (but not including) center. A10753

a(n) = ∑_{k=0..floor(n/2)} T(n,k), T given by A026725. A26733

T(n,0) + T(n,1) + ... + T(n,n), T given by A026670. A26677

a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026670. A26678

T(n,n-5), array T as in A038730. A38734