Properties of the Number 60928

Sixty Thousand Nine Hundred Twenty-Eight

Basics

Value: 60927 → 60928 → 60929

Parity: even

Prime: No

Previous Prime: 60923

Next Prime: 60937

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁹ × 7 × 17

Divisors: 1, 2, 4, 7, 8, 14, 16, 17, 28, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110111000000000

Octal: 167000

Duodecimal: 2B314

Hexadecimal: ee00

Square: 3712221184

Square Root: 246.8359779286642

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 edges in the hyperoctahedral (or cocktail party) graph of order n. A368757

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 358", based on the 5-celled von Neumann neighborhood. A281310

Unitary-σ σ multiply perfect numbers: numbers k such that A061765(k) = m·k for some integer m. A45795

a(n) = denominator of ∏_k=1..n k^μ(n+1-k), where μ(k) = A008683(k). A130089

Row sums of triangle A128182. A128183

Numbers m such that A034448(A188999(m)) = k·m for some k, where A034448 and A188999 are respectively the unitary and the bi-unitary σ function. A369204

Numbers k such that k, k²-1 and k²+1 are all fine, where a number m is fine if its prime factors are all less than m^1/3. A345896

Irregular triangle T(n,k) read by rows in which n-th row lists in colex order all series-reduced tree degree sequences D of n nodes encoded as t = ∏_{d in D} prime(d); n >= 4, 1 <= k <= A002865(n-2). A345970

For positive integers n, a multiset A of positive integers is called "n-good" if for any number 1 <= i <= n, we can find a submultiset B of A such that the sum of B is equal to i. a(n) is the number of minimal n-good multisets. A385675

Expansion of 1/(1 - 5·x - 4·x³). A60928