Properties of the Number 32973

Thirty-Two Thousand Nine Hundred Seventy-Three

Basics

Value: 32972 → 32973 → 32974

Parity: odd

Prime: No

Previous Prime: 32971

Next Prime: 32983

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 29 × 379

Divisors: 1, 3, 29, 87, 379, 1137, 10991, 32973

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000000011001101

Octal: 100315

Duodecimal: 170B9

Hexadecimal: 80cd

Square: 1087218729

Square Root: 181.58469098467523

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

Number of unlabeled rooted trees with n nodes (or connected functions with a fixed point). A81

Bisection of A000081 (even part). A100034

Number of trivially-perfect graphs on n nodes. A123467

Irregular triangle read by rows: T(n,k), n >= 2, 1 <= k <= n/2, = number of rooted forests with n nodes and k trees, with at least two nodes in each tree. A174135

Inverse WEIGH transform of A038000. A38001

Number of (2+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction. A250757

Number of matching pairs of patterns, the first of length n and the second of length k. A335518

Birooted trees: number of unlabeled trees with n nodes rooted at 2 indistinguishable roots. A303833

L.g.f.: ∑_n>=1 a(n)*xⁿ/n = ∑_n>=1 xⁿ/n·exp( ∑_k>=1 a(k)*x^n·k/k ). A209397

Triangle read by rows: T(s,n) (s>=1 and 1<=n<=s) = number of weighted trees with n nodes and positive integer node labels with label sum s. A303841