Properties of the Number -33110

Thirty-Three Thousand One Hundred Ten

Basics

Value: -33111 → -33110 → -33109

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 7 × 11 × 43

Divisors: 1, 2, 5, 7, 10, 11, 14, 22, 35, 43

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000000101010110

Octal: -100526

Duodecimal: -171B2

Hexadecimal: -8156

Square: 1096272100

Square Root: 181.96153439669604

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 T(n,k) read by rows: number of labeled 2-regular digraphs (multiple arcs and loops allowed) on n nodes with k components. A307804

a(n) = ∑_{k=0..floor(n/3)} n^k * binomial(2·n-2·k,n-3·k). A371827

a(n) = 169·n² - n. A157998

a(n) = 676·n² - 2·n. A158392

a(n) = 196·n² - 14. A158553

n written efficiently in natural numbers base, i.e., in form ...wxyz where n =1·z + 2·y + 3·x + 4·w + ... with z < 1, y < 2, x < 3, w < 4, ... A55992

Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set {t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^t+u+v) having two, four, six or seven distinct values for every i,j,k<=n. A211738

a(n) = denominator(n!*[zⁿ](z*(exp(z)+2·exp(-(1/2)*z)*cos((1/2)*z·3^1/2))/(1-exp(-z)))). A306149

Number of cusps in a class of degree-3n complex algebraic surfaces. A225018