Properties of the Number 56106

Fifty-Six Thousand One Hundred Six

Basics

Value: 56105 → 56106 → 56107

Parity: even

Prime: No

Previous Prime: 56101

Next Prime: 56113

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 1039

Divisors: 1, 2, 3, 6, 9, 18, 27, 54, 1039, 2078

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101101100101010

Octal: 155452

Duodecimal: 28576

Hexadecimal: db2a

Square: 3147883236

Square Root: 236.8670513178226

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

T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element. A283726

Number of equilateral triangles formed out of matches that can be found in a hexagonal chunk of side length n in hexagonal array of matchsticks. A45949

Least positive integer k such that prime(prime(k)), prime(prime(k·n)), prime(p) and prime(q) form a 4-term arithmetic progression for some pair of primes p and q. A261462

Number of compositions of n where the difference between largest and smallest parts equals four. A323121

Number of nX6 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element. A283724

Number of 3Xn 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element. A283728

Second spoke of a hexagonal spiral. A56106

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