Properties of the Number -33265

Thirty-Three Thousand Two Hundred Sixty-Five

Basics

Value: -33266 → -33265 → -33264

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 6653

Divisors: 1, 5, 6653, 33265

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000000111110001

Octal: -100761

Duodecimal: -17301

Hexadecimal: -81f1

Square: 1106560225

Square Root: 182.3869512876401

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 decimal digits in n-th Mersenne prime. A28335

Number of "ON" cubic cells at n-th stage in simple 3-dimensional cellular automaton: a(n) = A160428(n)/8. A161342

T(n,k)=Number of (n+2)X(k+2) arrays of permutations of 0..(n+2)*(k+2)-1 with each element moved 0 or 1 knight moves and equal numbers of elements advancing and retreating in the array numbered in row major order. A263706

Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 3 (most significant digit on right). A29496

Number of binary strings of length n with no substrings equal to 0000 or 0111. A164391

Number of (1+2)X(n+2) arrays of permutations of 0..n·3+5 with each element moved 0 or 1 knight moves and equal numbers of elements advancing and retreating in the array numbered in row major order. A263707

Poincaré series for hyperbolic reflection group with Coxeter diagram shown in Comments. A265049

Number of nX5 0..1 arrays with every element equal to 2 or 3 king-move adjacent elements, with upper left element zero. A297811

Number of partitions of n into parts not of the form 15k, 15k+4 or 15k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 6 are greater than 1. A35958

a(n)=a(n-1)+a(n-2)-d, where d=a(n/4) if 4 divides n, else d=0; 2 initial terms. A50194