Properties of the Number 33880

Thirty-Three Thousand Eight Hundred Eighty

Basics

Value: 33879 → 33880 → 33881

Parity: even

Prime: No

Previous Prime: 33871

Next Prime: 33889

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 5 × 7 × 11 ²

Divisors: 1, 2, 4, 5, 7, 8, 10, 11, 14, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010001011000

Octal: 102130

Duodecimal: 17734

Hexadecimal: 8458

Square: 1147854400

Square Root: 184.06520583749662

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

Triangle of Gaussian binomial coefficients [ n,k ] for q = 3. A22167

a(n) = n*(n+1)*(n+2)²/6. A4320

Expansion of (1-x)^-3 * (1-x²)^-2. A2624

Number of sublattices of index n in generic 4-dimensional lattice. A38991

Triangular array T(n,k) giving number of weakly connected digraphs with n labeled nodes and k arcs (n >= 1, 0 <= k <= n(n-1)). A62735

a(n) = Z(S_m; σ[1](n), σ[2](n),..., σ[m](n)) where Z(S_m; x₁,x₂,...,x_m) is the cycle index of the symmetric group S_m and σ[k](n) is the sum of k-th powers of divisors of n; m=3. A68020

Number T(n,k) of n-step walks on cubic lattice starting at (0,0,0), ending at (0,k,n-k) and using steps (0,0,1), (0,1,0), (1,0,0), (-1,1,1), (1,-1,1), and (1,1,-1); triangle T(n,k), n>=0, 0<=k<=n, read by rows. A328347

Number of singular 2 X 2 matrices over Z(n) (i.e., with determinant = 0). A20478

a(n) is the number of subsets of {1..n} that contain exactly 1 odd and 3 even numbers. A330299

Gaussian binomial coefficient [ n,3 ] for q=3. A6101