Properties of the Number 58256

Fifty-Eight Thousand Two Hundred Fifty-Six

Basics

Value: 58255 → 58256 → 58257

Parity: even

Prime: No

Previous Prime: 58243

Next Prime: 58271

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ⁴ × 11 × 331

Divisors: 1, 2, 4, 8, 11, 16, 22, 44, 88, 176

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110001110010000

Octal: 161620

Duodecimal: 29868

Hexadecimal: e390

Square: 3393761536

Square Root: 241.36279746472943

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

Number of cells formed by connecting all the 4n points on the perimeter of an n X n square by straight lines; a(0) = 0 by convention. A255011

a(1) = 3; for n > 1, a(n) = 4·a(n-1) + 4 - n. A353095

Numbers k such that k concatenated with k+4 gives the product of two numbers which differ by 8. A116189

a(n) is the number of permutations of length n that avoid the pattern 321 and the mesh pattern (12, 313) or the same sequence for the mesh pattern (12, 403). A289608

Number of (3+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction. A250758

Array read by ascending antidiagonals: A(1, k) = k; for n > 1, A(n, k) = (k + 1)*A(n-1, k) + k + 1 - n, with k > 0. A363365

Fold-switch-fold sequence defined by McFarlane and Withers for m=3: Let A(n) = If[Mod[A(n - 1), 2] == 0, A(n - 1)/2, (m - A(n - 1))2]; a(n)= If[ Mod[A(n - 1), 2] == 0, a(n - 1)/2, (π - a(n - 1))/2]. A136615

a(n) = ∑_k=0..n C(4·k,k)*C(4*(n-k),n-k). A78995

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