Properties of the Number 56070

Fifty-Six Thousand Seventy

Basics

Value: 56069 → 56070 → 56071

Parity: even

Prime: No

Previous Prime: 56053

Next Prime: 56081

Digit Sum: 18

Digital Root: 9

Palindrome: No

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

Divisors: 1, 2, 3, 5, 6, 7, 9, 10, 14, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101101100000110

Octal: 155406

Duodecimal: 28546

Hexadecimal: db06

Square: 3143844900

Square Root: 236.79104712805338

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

Alkane (or paraffin) numbers l(7,n). A5994

Triangle read by rows: T(n,k), n >=1, 0 <= k <= C(n,k), = number of n X n symmetric positive semi-definite matrices with 2's on the main diagonal and 1's and 0's elsewhere and with k 1's above the diagonal. A83029

a(n) = n*(n+1)*(2·n²+1)/6. A71238

Sum along upward diagonal of Pascal triangle up to (but not including) center. A10753

Triangle read by rows, Xⁿ * [1,0,0,0,...]; where X = a tridiagonal matrix with (1,1,1,...) in the main and subdiagonals and (1,2,3,...) in the subsubdiagonal. A140733

a(n) = n*(n + 1)*(17·n - 14)/6. A237617

a(n) is the smallest number which can be represented as the sum of n distinct positive cubes in exactly n ways, or 0 if no such number exists. A350270

O.g.f. A(x) satisfies: A(x) = 1 + x*∑_n>=0 2ⁿ * log( A(3ⁿ*x) )ⁿ / n!. A366226

Primitive terms of A023197 that are of the form 4u+2. A388020

Composite numbers k such that the difference between the odd and even aliquot parts of k divides k. A66193