Properties of the Number 23604

Twenty-Three Thousand Six Hundred Four

Basics

Value: 23603 → 23604 → 23605

Parity: even

Prime: No

Previous Prime: 23603

Next Prime: 23609

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 7 × 281

Divisors: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101110000110100

Octal: 56064

Duodecimal: 117B0

Hexadecimal: 5c34

Square: 557148816

Square Root: 153.63593329686907

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

Triangle read by rows: T(n,m) (n >= m >= 1) = number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares. A331452

Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges. A54548

T(n,k) = count of degree k monomials in the power sum symmetric polynomials p(μ,k) summed over all partitions μ of n. A209664

Triangle read by rows: T(n,k) is the number of chiral pairs of colorings of the facets of a regular n-dimensional orthotope using exactly k colors. Row n has 2n columns. A325010

Number of partitions of n into 4 sorts of parts. A246936

Number of hill-free Dyck paths of semilength n+2 and having length of first descent equal to 2 (a hill in a Dyck path is a peak at level 1). A118973

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n·k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph. A367304

Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having length of first descent equal to k (1<=k<=n; n>=1). A hill in a Dyck path is a peak at level 1. A118972

G.f.: ∑_n>=1 moebius(n)*xⁿ/(1 - Lucas(n)*xⁿ + (-1)ⁿ*x^2·n), where Lucas(n) = A000204(n). A204291

Number of distinct sums <= 1 of distinct reciprocals of integers <= n. A212607