Properties of the Number -8033

Thirty-Three

Basics

Value: -8034 → -8033 → -8032

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 29 × 277

Divisors: 1, 29, 277, 8033

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111101100001

Octal: -17541

Duodecimal: -4795

Hexadecimal: -1f61

Square: 64529089

Square Root: 89.62700485902673

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 partitions of n in which the greatest part is 7. A26813

Number of partitions of n²-n into parts not greater than n. A206240

E.g.f.: Limit_N->oo [ ∑_n>=0 (N + n)^4·n * (x/N³)ⁿ/n! ]^1/N. A266483

Number of integer partitions of n whose product is a multiple of n + 1. A379320

Number of partitions of n into at most 7 parts. A8636

Triangle formed by coefficients of the expansion of p(x, n), where p(x,n) = (1+x-x²)ⁿ⁺¹*∑_{j >= 0} (j+1)ⁿ*(-x + x²)^j. A156890

Expansion of (1 - x - 6·x²)/((1 - x)*(1 - x - 8·x²)). A100302

Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 147", based on the 5-celled von Neumann neighborhood. A270290

Compound filter: a(n) = P(σ(n), σ(2n)), where P(n,k) is sequence A000027 used as a pairing function, and σ is the sum of divisors (A000203). A286359

Number of integer compositions of n into parts not covering an interval of positive integers. A356846