Properties of the Number -33001

Thirty-Three Thousand One

Basics

Value: -33002 → -33001 → -33000

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 61 × 541

Divisors: 1, 61, 541, 33001

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000000011101001

Octal: -100351

Duodecimal: -17121

Hexadecimal: -80e9

Square: 1089066001

Square Root: 181.66177363441105

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

Apery (Apéry) numbers: ∑_k=0..n (binomial(n,k)*binomial(n+k,k))². A5259

Square array, read by antidiagonals, where row n equals the crystal ball sequence for the 2·n-dimensional lattice A_n x A_n. A143007

Square array read by ascending antidiagonals: T(n,k) = [x^k] 1/(1 - x) * Legendre_P(k, (1 + x)/(1 - x))ⁿ for n, k >= 0. A364113

Crystal ball sequence for the A4·A4 lattice. A143010

Odd composite integers m such that U(m)² == 1 (mod m) and V(m) == 4 (mod m), where U(m) and V(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=4 and b=-1, respectively. A337627

Denominators of the continued fraction convergents of log₁₀(11). A215756

Odd composite integers m such that A000032(3·m-J(m,5)) == 3·J(m,5) (mod m), where J(m,5) is the Jacobi symbol. A339724

Odd composite integers m such that A000045(3·m-J(m,5)) == 1 (mod m), where J(m,5) is the Jacobi symbol. A340235

Strong pseudoprimes to base 17. A20243

Strong pseudoprimes to base 29. A20255