Properties of the Number 63052

Sixty-Three Thousand Fifty-Two

Basics

Value: 63051 → 63052 → 63053

Parity: even

Prime: No

Previous Prime: 63031

Next Prime: 63059

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 11 × 1433

Divisors: 1, 2, 4, 11, 22, 44, 1433, 2866, 5732, 15763

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111011001001100

Octal: 173114

Duodecimal: 305A4

Hexadecimal: f64c

Square: 3975554704

Square Root: 251.10157307352736

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 0..2 arrays of length n+2·k-1 with sum less than 2·k in any length 2k subsequence (=less than 50% duty cycle). A212729

Irregular array where the n-th row are the divisors, not occurring earlier in the sequence, of the sum of the terms in all previous rows. a(1)=5. A120579

Trajectory of 3 under map n->7n-1 if n odd, n->n/2 if n even. A63871

a(n) = (sum of first n primes)² + sum of (squares of first n primes). A65762

Number of 0..2 arrays of length n+9 with sum less than 10 in any length 10 subsequence (=less than 50% duty cycle). A212726

Number of 0..2 arrays of length 2·n+1 with sum less than 2·n in any length 2n subsequence (=less than 50% duty cycle). A212731

Number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having no pyramids (a pyramid is a sequence u^pd^p or U^pd^2p for some positive integer p, starting at the x-axis). A108449

Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879. A63052