Properties of the Number 9258

Nine Thousand Two Hundred Fifty-Eight

Basics

Value: 9257 → 9258 → 9259

Parity: even

Prime: No

Previous Prime: 9257

Next Prime: 9277

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 1543

Divisors: 1, 2, 3, 6, 1543, 3086, 4629, 9258

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10010000101010

Octal: 22052

Duodecimal: 5436

Hexadecimal: 242a

Square: 85710564

Square Root: 96.21850133939938

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 non-biquanimous subsets of {1..n}. Sets with no subset having the same sum as the complement. A371792

Number of strict integer partitions with sum <= n that can be linearly combined using nonnegative coefficients to obtain n. A365311

T(n,k)=Number of (n+1)X(k+1) 0..1 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. A250797

Rectangular table, read by antidiagonals, defined by the following rule: start with all 1's in row zero; from then on, row n+1 equals the partial sums of row n excluding terms in columns k = m*(m+1)/2 (m>=1). A127054

Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section. A286795

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2. A213070

a(n) is the number of partitions of n with Durfee square of size <= 3. A330641

Number of factorization patterns of polynomials of degree n over F₄. A6169

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2. A214373

a(n) is the number of regions formed by n-secting the angles of a hexagon. A335733