Properties of the Number -33018

Thirty-Three Thousand Eighteen

Basics

Value: -33019 → -33018 → -33017

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5503

Divisors: 1, 2, 3, 6, 5503, 11006, 16509, 33018

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000000011111010

Octal: -100372

Duodecimal: -17136

Hexadecimal: -80fa

Square: 1090188324

Square Root: 181.70855786120808

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

Triangular array generated by its row sums: T(n,0)=1 for n >= 0, T(1,1)=2, T(n,k)=T(n,k-1)+d·r(n-k) for k=2,3,...,n, d=(-1)^k+1, n >= 2, r(h)=sum of the numbers in row h of T. A54098

Expansion of 1/((1 - x)*(2 - theta₂(sqrt(x))/(2·x^1/8))), where theta₂() is the Jacobi θ function. A303668

Numbers k such that there are 10 digits in k² and for each factor f of 10 (1, 2, 5) the sum of digit groupings of size f is a square. A153748

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 157", based on the 5-celled von Neumann neighborhood. A270331

T(n,3), array T as in A054098. A54105