Properties of the Number -32663

Thirty-Two Thousand Six Hundred Sixty-Three

Basics

Value: -32664 → -32663 → -32662

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 89 × 367

Divisors: 1, 89, 367, 32663

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111111110010111

Octal: -77627

Duodecimal: -16A9B

Hexadecimal: -7f97

Square: 1066871569

Square Root: 180.72907901054552

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

a(n) = 105 - 2ⁿ. A286812

Expansion of ∏_k>=1 (1 + x^k * (1 + k·x)). A336980

Semiprimes in A103379. A103399

a(n) = 2ⁿ - n*(n-1)/2. A14844

Numerators in the resistance triangle: T(k,n)=b, where b/c is the resistance distance R(k,n) for k resistors in an n-dimensional cube. A212045

Number of topologies on an n-set X such that for all·in X there is a y in X such that·and y are topologically indistinguishable. A280202

Leading diagonal of triangle in A080521. A80522

Triangle read by rows: T(n,k) = number of topologies on an n-set X such that there are exactly k elements in X that are topologically distinguishable, n >= 0, 0 <= k <= n. A280192

a(n) = numerator(-1/n + ∑_k=1..n 2^k-1/k). A332786

Triangular array read by rows. T(n,k) is the number of labeled transitive relations on [n] that have exactly k symmetric points. A355783