Properties of the Number 70560

Seventy Thousand Five Hundred Sixty

Basics

Value: 70559 → 70560 → 70561

Parity: even

Prime: No

Previous Prime: 70549

Next Prime: 70571

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁵ × 3 ² × 5 × 7 ²

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10001001110100000

Octal: 211640

Duodecimal: 34A00

Hexadecimal: 113a0

Square: 4978713600

Square Root: 265.63132345414385

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 T(n,k) read by rows: coefficients of a polynomial sequence occurring when calculating the n-th derivative of Lambert function W. A42977

Triangle of coefficients of n!*(1 - x)ⁿ*L_n(x/(1 - x)), where L_n(x) is the Laguerre polynomial. A123202

Factorial splitting: write n! = x·y*z with x<y<z and·maximal; sequence gives value of x. A61030

Triangular array read by rows: row n shows the coefficients of the polynomial p(x,n) constructed as in Comments; these polynomials form a strong divisibility sequence. A327320

a(n) = 2·n*n!. A52582

Expansion of e.g.f. x*(1-2·x)*(1 - 2·x - sqrt(1-4·x))/2 - x³. A52721

Triangle read by rows: T(n,k) is the number of rows of n colors with exactly k different colors counting chiral pairs as equivalent, i.e., the rows are reversible. A305621

Triangle read by rows: T(n,k) is the number of chiral pairs of rows of n colors with exactly k different colors. A305622

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,-1 or 2,2. A264190

Triangle with entry a(n,m) giving the total number of bracelets of n beads (D_n symmetry) with n colors available for each bead, but only m distinct colors present, with m from {1, 2, ..., n} and n >= 1. A214306