Properties of the Number -33648

Thirty-Three Thousand Six Hundred Forty-Eight

Basics

Value: -33649 → -33648 → -33647

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 701

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000001101110000

Octal: -101560

Duodecimal: -17580

Hexadecimal: -8370

Square: 1132187904

Square Root: 183.43391180476962

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(n) = ∑_k=0..2n-3 T(n,k) * T(n,k+3), with T given by A026519. A27265

a(n) = T(n, n-3), T given by A026552. Also a(n) = number of integer strings s(0), ..., s(n) counted by T, such that s(n) = 3. A26556

a(n) = ∑_k=0..2n-3 T(n,k) * T(n,k+3), with T given by A026552. A27275

a(n) = binomial(n+6,5) - 1. A62988

G.f.: A(x) = ∑_n>=0 (1 + x)ⁿ⁽ⁿ⁺¹/2) / 2ⁿ⁺¹. A173219

Array read by antidiagonals: A(n,k) is the number of nonnegative integer matrices with k distinct columns and any number of nonzero rows with column sums n and columns in decreasing lexicographic order. A331278

Expansion of ∏_{1 <= i <= j <= k} 1/(1 - x^i·j*k). A321360

Self-avoiding walks with n steps on the truncated trihexagonal tiling or (4,6,12) lattice. A249795

Expansion of B(x)/sqrt(1 + 2*(B(x)-1)), where B(x) is the g.f. of A000984. A387086

(n+1) + (n+1)(n+2) + ..., with n terms. A111686