Properties of the Number 23329

Twenty-Three Thousand Three Hundred Twenty-Nine

Basics

Value: 23328 → 23329 → 23330

Parity: odd

Prime: No

Previous Prime: 23327

Next Prime: 23333

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 41 × 569

Divisors: 1, 41, 569, 23329

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101101100100001

Octal: 55441

Duodecimal: 11601

Hexadecimal: 5b21

Square: 544242241

Square Root: 152.73833834371774

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

Pierpont semiprimes: semiprimes of the form (2^K)*(3^L)+1. A113432

Difference between first twin prime > 10ⁿ and 10ⁿ. A124001

Least positive number k such that 2^k mod k = 2n+1, or 0 if no such k exists. A124977

a(n) = 18·n² + 1. A157889

a(n) = 32·n² + 1. A158575

Number T(n,k) of elements k in all n X n Tesler matrices of nonnegative integers; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A259841

Place n equally spaced points on each side of a square, and join each of these points by a chord to the 3·n new points on the other three sides: sequence gives number of interior vertices in the resulting planar graph. A367277

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 internal vertices in the resulting planar graph. A367303

Number of partitions of n³ into at most two parts. A274324

Least m such that if r and s in {1/1, 1/4, 1/9,..., 1/n²} satisfy r < s, then r < k/m < s for some integer k. A24827