Properties of the Number 33862

Thirty-Three Thousand Eight Hundred Sixty-Two

Basics

Value: 33861 → 33862 → 33863

Parity: even

Prime: No

Previous Prime: 33857

Next Prime: 33863

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 16931

Divisors: 1, 2, 16931, 33862

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010001000110

Octal: 102106

Duodecimal: 1771A

Hexadecimal: 8446

Square: 1146635044

Square Root: 184.01630362552118

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 (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7. A252303

Number of (7+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7. A252312

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence). A25114

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, 1, -1), (1, -1, 0), (1, 1, 1)}. A149435

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7. A252305

Sorted number reached from starter n in Sort-then-add sequence, or -1 if never reaches sorted number. A33862

Number of labeled graphs on n nodes with degree set {2,4}. A228697

Array read by descending antidiagonals: T(n,m) is the number of sequences of length n >= 0 with elements in 1..m-1 such that no iterated difference is divisible by m >= 1. A353434

Square array read by ascending antidiagonals, complementary Bell numbers iterated by the Bell transform. A265313