Properties of the Number -20062

Twenty Thousand Sixty-Two

Basics

Value: -20063 → -20062 → -20061

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 7 × 1433

Divisors: 1, 2, 7, 14, 1433, 2866, 10031, 20062

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100111001011110

Octal: -47136

Duodecimal: -B73A

Hexadecimal: -4e5e

Square: 402483844

Square Root: 141.6403897198818

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

G.f. satisfies: A(x) = 1/(1 + x·A(x²)) and also the continued fraction: 1 + x·A(x³) = [1; 1/x, 1/x², 1/x⁴, 1/x⁸, ..., 1/x^{2^(n-1}), ...]. A101912

Number of balanced partitions of n: the largest part equals the number of parts. A47993

Expansion of 1/( ∏_k=0..2 (1 - (3·k+1) * x) )^1/3. A383627

a(n) = (Sum{k=0..n-1} a(k)) - a(n-3), with a(0)=0, a(1)=0, a(2)=1. A49856

a(n+1)-+a(n)=prime, a(n+1)*a(n)=Average of twin prime pairs, a(1)=3,a(2)=10. A154496

G.f.: A(x) = ∑_n>=0 x^n*(n+1/2) / ∏_k=1..n (1-x^k)^k. A206138

Subdiagonal of array of n-gonal numbers A081422. A81423

Fibonacci sequence beginning 9, 7. A190995

Triangular array read by rows: T(n,k) is the number of compositions of n that have exactly k 3's; n>=0, 0<=k<=floor(n/3). A218796

Numbers k such that 2^k(k-1) == 8 (mod k). A126662