Properties of the Number 62062

Sixty-Two Thousand Sixty-Two

Basics

Value: 62061 → 62062 → 62063

Parity: even

Prime: No

Previous Prime: 62057

Next Prime: 62071

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 7 × 11 × 13 × 31

Divisors: 1, 2, 7, 11, 13, 14, 22, 26, 31, 62

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1111001001101110

Octal: 171156

Duodecimal: 2BABA

Hexadecimal: f26e

Square: 3851691844

Square Root: 249.1224598465582

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

Product of the largest prime divisors of composite numbers between successive primes. A76977

a(n) = lcm(1,...,2n+4)/((n+1)*binomial(2n+2, n+1)). A119636

Triangular array T(n,k) = k ∑_j=0..k-1 (-1)^j binomial(k-1,j) (n-1-j)^n-1, 1<=k<=n, read by rows. A281485

T(n,k)=Number of (n+3)X(k+3) 0..2 matrices with each 4X4 subblock idempotent. A224728

Smallest increasing sequence where each term is coprime to preceding three terms. A62062

Triangle read by rows: T(n,k) is the number of 2-Motzkin paths (i.e., Motzkin paths with blue and red level steps) without red level steps on the x-axis, having length n and k level steps (0 <= k <= n). A126222

G.f. A(x) satisfies: [xⁿ] A(x)^n²-n+1 = 0 for n>=2. A229041

Triangle read by rows: a(n,k) = number of permutations in S_n which avoid the pattern 123 and have exactly k descents. A166073