Properties of the Number -20650

Twenty Thousand Six Hundred Fifty

Basics

Value: -20651 → -20650 → -20649

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 ² × 7 × 59

Divisors: 1, 2, 5, 7, 10, 14, 25, 35, 50, 59

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101000010101010

Octal: -50252

Duodecimal: -BB4A

Hexadecimal: -50aa

Square: 426422500

Square Root: 143.70107863199914

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

Integers that are Rhonda numbers to base 18. A255735

Triangle giving T(n,k) = number of (n,k) labeled rooted Greg trees (n >= 1, 0<=k<=n-1). A48160

Sizes of successive increasing gaps between 2-pseudoprimes. A175738

Array read by antidiagonals: T(m,n) = number of m-ary words of length n with adjacent elements differing by 3 or less. A285267

Number of arrays in [1..6]ⁿ with adjacent elements differing by three or less. A126474

E.g.f. satisfies A(x) = 1/(1 - x·exp(x·A(x)))². A377541

a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3), ..., a(n)] and [0; a(1), a(2), a(3), ..., a(n)]. A58082

Numbers k such that k and k² use only the digits 0, 2, 4, 5 and 6. A136898

T(n, k) = [x^k] ∑_j=0..n j!*binomial(x, j), for 0 <= k <= n, triangle read by rows. A176663

Wiener index of the n-web graph. A180576