Properties of the Number -32725

Thirty-Two Thousand Seven Hundred Twenty-Five

Basics

Value: -32726 → -32725 → -32724

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 ² × 7 × 11 × 17

Divisors: 1, 5, 7, 11, 17, 25, 35, 55, 77, 85

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111111111010101

Octal: -77725

Duodecimal: -16B31

Hexadecimal: -7fd5

Square: 1070925625

Square Root: 180.90052515125544

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

Irregular triangle read by rows: T(n,k) (0 <= k <= n²) are coefficients of cluster density function for site percolation on an n X n 2D triangular lattice with periodic boundary conditions. A365940

Triangle read by rows where T(n,k) is the number of separable type set partitions of {1..n} into k blocks. A386635

Number of non-complete compositions of n. A188575

G.f.: ∑_k>=1 x^2·k/(1+x^2·k) * ∏_k>=1 1/(1-x^k). A305121

Row sums of triangle A134480. A134481

Partition number array, called M32(-5), related to A013988(n,m)= |S2(-5;n,m)| ( generalized Stirling triangle). A144268

Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3, 4 or 5 (n >= 0, 0 <= k <= 5n). A151338

The triangle in A151338 read by rows downwards. A151509

Denominator of A010786(n+1) / A010786(n). A208450

a(n) = 2ⁿ⁺² - 3·n - 4. A95264