Properties of the Number -33549

Thirty-Three Thousand Five Hundred Forty-Nine

Basics

Value: -33550 → -33549 → -33548

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 53 × 211

Divisors: 1, 3, 53, 159, 211, 633, 11183, 33549

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000001100001101

Octal: -101415

Duodecimal: -174B9

Hexadecimal: -830d

Square: 1125535401

Square Root: 183.1638610643486

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

a(0) = 1 by convention; for n>0, a(n) is the number of points in the n-th figure shown in A255011 (meaning the figure with 4n points on the perimeter). A331449

Triangle read by rows: T(n,m) (n >= m >= 1) = number of vertices formed by drawing the lines connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares. A331453

Sequence is defined by property that (a0,a1,a2,a3,...) = binomial transform of (a0,a0,a0,a1,a1,a1,a2,a2,a2,a3,a3,a3,...). A51164

a(n) = F(n+4) * F(n+1) - 4 * (-1)ⁿ where F(n) = A000045(n) are the Fibonacci numbers. A341208

Number of mobiles (circular rooted trees) with n nodes and 3 leaves. A55341

Column 4 of A060244. A291589

Numbers k such that 131·2^k+1 is prime. A32415

Triangle T(n,k) = coefficient of xⁿ in expansion of ((1-sqrt(1-4·x))/((1-x)*2))^k = sum(n>=k, T(n,k) * xⁿ). A200965

Absolute value of the minimum coefficient of (1 - x)³ * (1 - x²)³ * (1 - x³)³ * ... * (1 - xⁿ)³. A380517