Properties of the Number -30634

Thirty Thousand Six Hundred Thirty-Four

Basics

Value: -30635 → -30634 → -30633

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 17 ² × 53

Divisors: 1, 2, 17, 34, 53, 106, 289, 578, 901, 1802

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111011110101010

Octal: -73652

Duodecimal: -1588A

Hexadecimal: -77aa

Square: 938441956

Square Root: 175.025712396779

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

T(n,k)=Number of n-bead necklaces labeled with numbers -k..k not allowing reversal, with sum zero and three times sum of squares <= n·k*(k+1). A208814

No-3-in-line problem on n X n grid: total number of ways of placing 2n points on n X n grid so no 3 are in a line. No symmetries are taken into account. A755

Sum of n-th antidiagonal of A082191. A82195

Binomial(n,4) - A290447(n). A290461

Diagonal sums of the Riordan array A116382. A116384

a(n) = ∑_{k=0..floor(n/3)} binomial(2·n+1,n-3·k). A371873

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

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 611", based on the 5-celled von Neumann neighborhood. A273214

a(n) = A006561(n) - A290447(n). A290465

Number of n-bead necklaces labeled with numbers -3..3 not allowing reversal, with sum zero and three times sum of squares <= n*(3)*(3+1). A208809