Properties of the Number 32084

Thirty-Two Thousand Eighty-Four

Basics

Value: 32083 → 32084 → 32085

Parity: even

Prime: No

Previous Prime: 32083

Next Prime: 32089

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 13 × 617

Divisors: 1, 2, 4, 13, 26, 52, 617, 1234, 2468, 8021

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111110101010100

Octal: 76524

Duodecimal: 16698

Hexadecimal: 7d54

Square: 1029383056

Square Root: 179.12007146045917

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+1)X(k+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally, diagonally or antidiagonally, with no adjacent elements equal. A232515

Number of ways to place 3 nonattacking knights on an n X n board. A172134

If a Fibonacci sequence is formed with first term = number of digits in n and second term = sum of decimal digits in n, then n itself occurs as a term in the sequence after the first two terms. A38868

Number of multisets that occurring as the peak heights multiset of a Dyck n-path that are the also the peak heights multiset of a smaller Dyck path. A208740

a(n) = 1·t(n) + 2·t(n-1) + ... + k·t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes). A23862

Number of (n+1)X(6+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally, diagonally or antidiagonally, with no adjacent elements equal. A232513

Number of (3+1)X(n+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally, diagonally or antidiagonally, with no adjacent elements equal. A232518

Fibonacci sequence beginning 5, 17. A22141

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (F(2), F(3), F(4), ...). A25071

Doubles (index 2+) under "BHJ" (reversible, identity, labeled) transform. A32084