Properties of the Number -32763

Thirty-Two Thousand Seven Hundred Sixty-Three

Basics

Value: -32764 → -32763 → -32762

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 67 × 163

Divisors: 1, 3, 67, 163, 201, 489, 10921, 32763

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111111111111011

Octal: -77773

Duodecimal: -16B63

Hexadecimal: -7ffb

Square: 1073414169

Square Root: 181.0055247775603

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

Array read by antidiagonals: T(n,k) is the number of binary rooted trees with n leaves of k colors and all non-leaf nodes having out-degree 2. A319539

G.f.: ∏_{i>=1, j>=1} 1/(1 - x^i·j)^i·j. A280540

a(n) = 8ⁿ - n. A24089

a(n) = 2ⁿ - 5. A168616

Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a power of 2. A353889

Number of binary rooted trees (every node has out-degree 0 or 2) with n labeled leaves (2n-1 nodes in all) and at most 2 distinct labels. Also the number of expressions in at most two variables constructible with n-1 instances of a single commutative and nonassociative binary operator. A83563

Numbers k such that (k+j) mod (2+j) = 1 for j from 0 to 8 and (k+9) mod 11 <> 1. A96026

Numbers that can be represented as both a^x+x and b^y-y, for some a, b, x, y > 1. A99226

Denominators of convergents to π using best rational approximation whose denominator is between consecutive powers of 2: [2ⁿ, 2ⁿ⁺¹-1], where n = 0, 1, 2, ... A325159

Partial sums of A162255. A164053