Properties of the Number 32006

Thirty-Two Thousand Six

Basics

Value: 32005 → 32006 → 32007

Parity: even

Prime: No

Previous Prime: 32003

Next Prime: 32009

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 13 × 1231

Divisors: 1, 2, 13, 26, 1231, 2462, 16003, 32006

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111110100000110

Octal: 76406

Duodecimal: 16632

Hexadecimal: 7d06

Square: 1024384036

Square Root: 178.90220792377048

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) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings). A235310

Number of partitions of n such that the absolute value of the difference between the number of odd parts and the number of even parts is <=1. A239835

Matula-Goebel numbers of unlabeled rooted identity RPMG-trees, meaning the Matula-Goebel numbers of the branches of any non-leaf node are relatively prime. A316469

Matula-Goebel tree number of tree n with a new leaf added below each existing vertex. A348067

Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings). A235303

Number of (n+1) X (7+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings). A235309

Number of partitions of n into parts not of the form 23k, 23k+8 or 23k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 10 are greater than 1. A35996

Consider the 2^n-1 monic polynomials f(x) with coefficients 0 or 1, degree n and f(0)=1. Sequence gives triangle read by rows, in which T(n,k) (n>=1) is the number of such polynomials of thickness k (2 <= k <= n+1). A169940

"AFK" (ordered, size, unlabeled) transform of 2,1,1,1,... A32006

a(n) = ∑_k=0..n binomial(2·n+3·k,n-k). A360144