Properties of the Number 2323

Two Thousand Three Hundred Twenty-Three

Basics

Value: 2322 → 2323 → 2324

Parity: odd

Prime: No

Previous Prime: 2311

Next Prime: 2333

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 23 × 101

Divisors: 1, 23, 101, 2323

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100100010011

Octal: 4423

Duodecimal: 1417

Hexadecimal: 913

Square: 5396329

Square Root: 48.19751030914356

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

Doublets: base-10 representation is the juxtaposition of two identical strings. A20338

Numbers that are the sum of 4 positive 5th powers. A3349

Numbers that are the sum of 10 positive 7th powers. A3377

Numbers using only digits 2 and 3. A32810

MM-numbers of nesting multiset partitions. A326256

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250994

a(1) = 1; for n > 1, a(n) is the smallest positive number such that a(n) - a(n-1) = sopfr(a(n)) + sopfr(a(n-1)), where sopfr(k) is the sum of the primes dividing k, with repetition. A369348

Numbers n such that P(4n) is prime, where P(m) is the number of partitions of m. A111045

MM-numbers of capturing multiset partitions. A326255

Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n³ + 3·n² + 8·n)/6 (n > 0). A3600