Properties of the Number -32656

Thirty-Two Thousand Six Hundred Fifty-Six

Basics

Value: -32657 → -32656 → -32655

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 13 × 157

Divisors: 1, 2, 4, 8, 13, 16, 26, 52, 104, 157

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111111110010000

Octal: -77620

Duodecimal: -16A94

Hexadecimal: -7f90

Square: 1066414336

Square Root: 180.7097119692243

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

Fourier coefficients of the modular form (1/t_3A²) * F_3A¹². A341558

a(n) = T(2n,n-1), T given by A026780. A26782

10th-order Fibonacci numbers: a(n+1) = a(n)+...+a(n-9) with a(0) = ... = a(8) = 0, a(9) = 1. A122265

A014486-indices for the compact representation of Beanstalk-tree, with the lesser numbers coming to the left hand side. A218781

Euler transform of A065958. A301978

a(n) = n*(n³ - n + 2)/2. A101374

Row sums of A103691. A103692

If an array is made of columns of -nacci sequences, fibo-, tribo- etc. all starting w. 1,1,2 etc, the NW to SE diagonals can be extended by computation. The above is diagonal 8. See A159741 for details. A159744

Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] with longest consecutive chain size less than 3, when 1 and n are considered to be consecutive. A340107

Number of Dyck 2n-paths with all ascents of even length and all descents of odd length. A182530