Properties of the Number -32627

Thirty-Two Thousand Six Hundred Twenty-Seven

Basics

Value: -32628 → -32627 → -32626

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 59 × 79

Divisors: 1, 7, 59, 79, 413, 553, 4661, 32627

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111111101110011

Octal: -77563

Duodecimal: -16A6B

Hexadecimal: -7f73

Square: 1064521129

Square Root: 180.6294549623621

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

T(n,k) = Number of (n+2) X (k+2) 0..1 arrays with no 3 X 3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 1 and no column sum 1. A255101

Greatest n-bit number whose binary representation's substrings represent the maximal number (A112509(n)) of distinct integers. A112511

Number of finite regions in a complete bipartite graph where the vertices in the two parts are placed on opposite sides of a parabola at integer·coordinates |x| = 1, 2, ...n. A392426

Expansion of x/(1 - 7·x - 10·x²). A15568

Number of triangular partitions of n of order 6. A276235

Expansion of ∑_k>=0 x^k² / ∏_j=1..k (1 - x^j)^j. A318771

Number of (n+2)X(2+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 1 and no column sum 1. A255095

Number of (n+2)X(7+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 1 and no column sum 1. A255100

Number of base 21 circular n-digit numbers with adjacent digits differing by 7 or less. A125433