Properties of the Number 6365

Six Thousand Three Hundred Sixty-Five

Basics

Value: 6364 → 6365 → 6366

Parity: odd

Prime: No

Previous Prime: 6361

Next Prime: 6367

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 19 × 67

Divisors: 1, 5, 19, 67, 95, 335, 1273, 6365

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011011101

Octal: 14335

Duodecimal: 3825

Hexadecimal: 18dd

Square: 40513225

Square Root: 79.78095010715278

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

11-gonal (or hendecagonal) numbers: a(n) = n*(9·n-7)/2. A51682

D-toothpick sequence of the third kind starting with a single toothpick. A220500

Numbers k such that (2^k + 1)² - 2 = 4^k + 2^k+1 - 1 is prime. A91513

T(n,k)=Number of (n+3)X(k+3) binary arrays with no more than one of any consecutive four bits set in any row or column. A203048

Wiener index of a benzenoid consisting of a double-step zig-zag chain of n hexagons (n >= 2, s = 2123; see the Gutman et al. reference). A193395

Number of compositions (ordered partitions) of n into at most 6 prime parts. A347743

Irregular triangle read by rows T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs (V,E') with |E'|=k of the complete labeled graph K_n=(V,E). A125205

Triangular array T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs obtained from the complete labeled graph K_n by removing k edges. A125206

T(n,k) is the number of non-equivalent distinguishing partitions of the cycle on n vertices with exactly k parts. Regular triangle read by rows, n >= 1, 1 <= k <= n. A324802

Number of partitions p of n such that (maximal multiplicity of the parts of p) < (number of distinct parts of p). A240305