Properties of the Number 63056

Sixty-Three Thousand Fifty-Six

Basics

Value: 63055 → 63056 → 63057

Parity: even

Prime: No

Previous Prime: 63031

Next Prime: 63059

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 7 × 563

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 56, 112

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111011001010000

Octal: 173120

Duodecimal: 305A8

Hexadecimal: f650

Square: 3976059136

Square Root: 251.10953785151213

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

Lexicographically largest binary de Bruijn sequences, B(2,n). A166316

Poincaré series [or Poincare series] P(C_4,2(0); t). A124637

a(n) cannot be prefixed or followed by any digit to form a prime ('empty' prefixes allowed). A32736

a(n) cannot be prefixed or followed by any digit to form a prime ('empty' prefixes and suffixes are allowed). A32738

To calculate n-th term, find all shortest common superstrings of the binary representations of all natural numbers from 1 to n, read them as numbers in base-2, and pick max. A175810

a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063055 in order to obtain a term in the trajectory of 1997. A63056

Array T read by antidiagonals: T(m,n) = number of lattice walks of minimal length from (0,0) to (m,n) using steps in directions from {(1,0), (0,1), (3,0), (2,1), (1,2), (0,3)}. A292435