Properties of the Number -20648

Twenty Thousand Six Hundred Forty-Eight

Basics

Value: -20649 → -20648 → -20647

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 29 × 89

Divisors: 1, 2, 4, 8, 29, 58, 89, 116, 178, 232

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101000010101000

Octal: -50250

Duodecimal: -BB48

Hexadecimal: -50a8

Square: 426339904

Square Root: 143.69411957348845

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

Word structures of length n using a 6-ary alphabet. A56273

T(n,k)=Number of length n+4 0..k arrays with some disjoint pairs in every consecutive five terms having the same sum. A247927

Triangle of partial sums of Stirling numbers of 2nd kind (A008277): T(n,k) = ∑_i=1..k Stirling2(n,i), 1<=k<=n. A102661

T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock trace equal to some horizontal or vertical neighbor 2X2 subblock trace. A185750

T(n,k) = Number of (n+1) X (k+1) binary arrays with every 2 X 2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2 X 2 subblock traces. A186939

T(n,k)=Number of nXk 0..5 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..5 introduced in row major order. A209744

Number of n-variations of the set {1,2,...,n+1} satisfying p(i)-i in {-2,0,2}, i=1..n (an n-variation of the set N_n+s = {1,2,...,n+s} is any 1-to-1 mapping p from the set N_n = {1,2,...,n} into N_n+s = {1,2,...,n+s}). A217694

T(n,k)=Number of n-step one or two space at a time bishop's tours on a kXk board summed over all starting positions. A187046

Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives i values. A53676

Number of palindromic structures using a maximum of six different symbols. A56471