Properties of the Number 58984

Fifty-Eight Thousand Nine Hundred Eighty-Four

Basics

Value: 58983 → 58984 → 58985

Parity: even

Prime: No

Previous Prime: 58979

Next Prime: 58991

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 73 × 101

Divisors: 1, 2, 4, 8, 73, 101, 146, 202, 292, 404

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1110011001101000

Octal: 163150

Duodecimal: 2A174

Hexadecimal: e668

Square: 3479112256

Square Root: 242.86621831782205

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 sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(5,n) (with n at least 4) missing three edges, where exactly two removed edges are incident to the same vertex in the 5-point set and exactly two removed edges are incident to the same vertex in the other set. A343374

Number of ways to place n nonattacking composite pieces queen + rider[3,5] on an n X n chessboard. A189880

Number of n X 7 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281204

G.f.: x * ∏_k>=1 1/(1 - a(k)*(-x)^k)^(-1^k). A308245

Array with a variable number of columns, where terms in the n-th row are the differences (computed in decimal base and divided by 9) between equal ratio permutations, found in the base n>=2, and the first (in ascending order of digits) minimal value permutation of {0,1,...,n}. A212958

Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(4,n) (with n at least 4) missing three edges, where exactly two removed edges are incident to the same vertex in the 4-point set and exactly two removed edges are incident to the same vertex in the other set. A343373

T(n,k)=Number of nXk 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281205

Number of partitions of n in which number of parts is not 2. A58984