Properties of the Number -62642

Sixty-Two Thousand Six Hundred Forty-Two

Basics

Value: -62643 → -62642 → -62641

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 31321

Divisors: 1, 2, 31321, 62642

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111010010110010

Octal: -172262

Duodecimal: -30302

Hexadecimal: -f4b2

Square: 3924020164

Square Root: 250.28383887099062

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

Expansion of (1 + x² - sqrt( 1 - 4·x + 2·x² + x⁴)) / (2·x) in powers of x. A82582

Number of Dyck paths of semilength n with no DDUU. A86581

Generalized Catalan numbers A(x)² -(1+x)²*A(x) +x*(2+x+x²) =0. A25242

Decimal concatenations of the 38 quintuples (d1,d2,d3,d4,d5) with elements in {2,4,6} for which there exists a prime p >= 7 such that the differences between the 6 consecutive primes starting with p are (d1,d2,d3,d4,d5). A78870

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k DDUU's, where U=(1,1), D=(1,-1) (0<=k<=floor(n/2)-1 for n>=2). A114492

Sum of the heights of all nonnegative lattice paths from (0,0) to (n,0) such that slopes of adjacent steps differ by at most one, assuming zero slope before and after the paths. A333679

Triangle read by rows: T(n,k) is number of Dyck n-paths with k UUDDs, 0 <= k <= n/2. A98978

Numbers k such that 175·2^k+1 is prime. A32464

Number of (6+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250774