Properties of the Number 58479

Fifty-Eight Thousand Four Hundred Seventy-Nine

Basics

Value: 58478 → 58479 → 58480

Parity: odd

Prime: No

Previous Prime: 58477

Next Prime: 58481

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 3 × 101 × 193

Divisors: 1, 3, 101, 193, 303, 579, 19493, 58479

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110010001101111

Octal: 162157

Duodecimal: 29A13

Hexadecimal: e46f

Square: 3419793441

Square Root: 241.82431639518802

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

Total number of edges formed after n points have been placed in general position on each edge of a triangle (as in A365929). A366932

Triangle read by rows: absolute values of odd-numbered rows of A225356. A225076

Triangle T(n, k) = T(n, k-1) + (-1)^k*A060187(n+2,k+1) if k <= floor(n/2), otherwise T(n, n-k), with T(n, 0) = T(n, n) = 1, read by rows. A225356

Numbers with five neighboring primes on the hexagonal spiral board of odd numbers. A345654

Irregular triangle read by rows: T(n,k) (0 <= k <= n²) are coefficients of cluster density function for site percolation on an n X n 2D square lattice with open boundary conditions. A365946

Irregular triangle read by rows: T(n,k) (0 <= k <= n²) are coefficients of cluster density function for site percolation on an n X n 2D triangular lattice with open boundary conditions. A365945

a(n) = (n³)/2 + (3·n²)/2 + 3·n + 3. A127873

a(n) = (2·n + 1)⁷. A16759

Total number of interior nodes in all essentially parallel series-parallel networks with n labeled edges, multiple edges allowed. A58479

Array read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the k·n boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of edges in the resulting planar graph. A392282