Properties of the Number 58977

Fifty-Eight Thousand Nine Hundred Seventy-Seven

Basics

Value: 58976 → 58977 → 58978

Parity: odd

Prime: No

Previous Prime: 58967

Next Prime: 58979

Digit Sum: 36

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 6553

Divisors: 1, 3, 9, 6553, 19659, 58977

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110011001100001

Octal: 163141

Duodecimal: 2A169

Hexadecimal: e661

Square: 3478286529

Square Root: 242.85180666406416

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

(1/2)*number of regular tetrahedra that can be formed using the points in an (n+1) X (n+1) X (n+1) lattice cube. A103158

Number of n X 2 0..1 arrays with every element equal to 2 or 3 king-move adjacent elements, with upper left element zero. A297809

Array read by antidiagonals: T(m,n) is the number of connected dominating sets in the rook graph K_m X K_n. A360875

Number of connected dominating sets in the 2 X n rook graph. A360876

Number of integers k such that floor((rⁿ)/k)=n, where r = golden ratio = (1+sqrt(5))/2. A182613

Numbers k such that k + sopfr(k) is a fourth power. A387246

Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k peaks of height >1 (n >= 1; 0 <= k <= n-1). A128747

a(n) is the least k such that k + sopfr(k) has exactly n prime factors, counted with multiplicity. A389973

Subtraction of polynomial coefficients of MacMahon A060187 from third derivative of Pascal's triangle A155863: p(x,n)=(If[n == 0, 1, xⁿ + 1 + x·D[( x + 1)^{n + 1}, {x, 3}]] - 2ⁿ*(1 - x)^{1 + n}*LerchPhi[x, -n, 1/2])/x. A155871

For a rational number p/q let f(p/q) = sum of distinct prime factors (A008472) of p+q divided by number of distinct prime factors (A001221) of p+q; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0. A58977