Properties of the Number 4366

Four Thousand Three Hundred Sixty-Six

Basics

Value: 4365 → 4366 → 4367

Parity: even

Prime: No

Previous Prime: 4363

Next Prime: 4373

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 37 × 59

Divisors: 1, 2, 37, 59, 74, 118, 2183, 4366

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 1000100001110

Octal: 10416

Duodecimal: 263A

Hexadecimal: 110e

Square: 19061956

Square Root: 66.07571414672717

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 partitions of n such that the least part occurs at least twice. A117989

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) - m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 2, read by rows. A157211

Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 6 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=3·floor(n/2), read by rows. A238550

Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 8 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=4·floor(n/2), read by rows. A238557

Number of fixed polyominoes with n cells that have a horizontal axis of symmetry that passes through the centers of cells. A346799

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..3 introduced in row major order. A204642

Number of strict integer partitions of n such that no part can be written as a (strictly) positive linear combination of the others. A365006

Number of integer compositions of n with all distinct 0-prepended first differences. A389601

Number of even parts in all partitions of n into distinct parts. A116680

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero. A299060