Properties of the Number -520676

Five Hundred Twenty Thousand Six Hundred Seventy-Six

Basics

Value: -520677 → -520676 → -520675

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 13 × 17 × 19 × 31

Divisors: 1, 2, 4, 13, 17, 19, 26, 31, 34, 38

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1111111000111100100

Octal: -1770744

Duodecimal: -211398

Hexadecimal: -7f1e4

Square: 271103496976

Square Root: 721.5788245230038

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

a(n) = binomial(2·n,n) - binomial(2·n-2,n-1); or (3n-2)*C(n-1), where C = Catalan numbers (A000108). A51924

a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n and s(0) = 2. Also a(n) = sum of numbers in row n+1 of array T defined in A026009. A26010

Expansion of (1+x)/(1-x)¹². A57788

s(k)-s(j), where (s(k),s(j)) is the least pair of central binomial coefficients for which n divides their difference. A205014

a(n) is the number of ballot sequences of length n tied or won by at most 2 votes. A337499

Triangle T(n,k), 0 <= k <= n, defined by : T(n,k) = 0 if k < 0, T(0,k) = 0^k, (n+2)*(2·n-2·k+1)*T(n,k) = (2·n+1)*( 4*(2·n-2·k+1)*T(n-1,k-1) + (n+2·k+2)*T(n-1,k) ). A123382

a(n) is the number of ballot sequences of length n tied or won by at most 3 votes. A337500