Properties of the Number 23845

Twenty-Three Thousand Eight Hundred Forty-Five

Basics

Value: 23844 → 23845 → 23846

Parity: odd

Prime: No

Previous Prime: 23833

Next Prime: 23857

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 19 × 251

Divisors: 1, 5, 19, 95, 251, 1255, 4769, 23845

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110100100101

Octal: 56445

Duodecimal: 11971

Hexadecimal: 5d25

Square: 568584025

Square Root: 154.4182631685773

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

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 2. A50031

Trajectory of 290 under the Reverse and Add! operation carried out in base 4, written in base 10. A75299

Place n equally spaced points on each side of an equilateral triangle, and join each of these points by a chord to the 2·n new points on the other two sides: sequence gives number of vertices in the resulting planar graph. A366483

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 587", based on the 5-celled von Neumann neighborhood. A283142

The smallest term in A061862 with exactly n distinct partitions into a sum of nonnegative powers of its digits. A388297

Number of n X 3 binary arrays with rows and columns lexicographically nondecreasing and column sums nondecreasing. A266423

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (1, -1, 0), (1, 0, 1), (1, 1, -1)}. A148974

Sum of exponents in prime-power factorization of binomial(5n, n+3). A23845

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