Properties of the Number 6336

Six Thousand Three Hundred Thirty-Six

Basics

Value: 6335 → 6336 → 6337

Parity: even

Prime: No

Previous Prime: 6329

Next Prime: 6337

Digit Sum: 18

Digital Root: 9

Palindrome: Yes

Factorization: 2 ⁶ × 3 ² × 11

Divisors: 1, 2, 3, 4, 6, 8, 9, 11, 12, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011000000

Octal: 14300

Duodecimal: 3800

Hexadecimal: 18c0

Square: 40144896

Square Root: 79.5989949685296

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

Array T(m,n) read by antidiagonals: number of domino tilings (or dimer tilings) of the m X n grid (or m X n rectangle), for m>=1, n>=1. A99390

12-gonal (or dodecagonal) numbers: a(n) = n*(5·n-4). A51624

Numbers that are divisible by exactly 9 primes with multiplicity. A46312

Number of partitions of 4n into 4 parts. A238340

12 times triangular numbers. A49598

Number of domino tilings of 4 X (n-1) board. A5178

Longest edge a of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a² + b²), sqrt(b² + c²), sqrt(a² + c²) are integers). A31173

Coefficient triangle of certain polynomials N(4; m,x). A62264

Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from top row to lower right corner, and no 1 having more than two 1's adjacent. A391823

a(n) = T(n, floor(n/2)), where T is given by A026584. A26595