Properties of the Number -49784

Forty-Nine Thousand Seven Hundred Eighty-Four

Basics

Value: -49785 → -49784 → -49783

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 7 ² × 127

Divisors: 1, 2, 4, 7, 8, 14, 28, 49, 56, 98

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1100001001111000

Octal: -141170

Duodecimal: -24988

Hexadecimal: -c278

Square: 2478446656

Square Root: 223.12328430712918

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. A(x) satisfies: A(A(x)) = x + 2·A(x)². A107700

Bisection (odd-indexed terms) of A107700. A107699

T(n,k) is the number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings). A234490

Number of compositions (ordered partitions) of n into distinct parts, the least being 3. A339164

Triangle T(n,k), read by rows: coefficients for numerical integration near a singularity (n >= 0 and 0 <= k <= n). A324124

Number of (n+1) X (3+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings). A234485

Number of (n+1) X (4+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings). A234486

Number of pairs in generation n of the tree T defined in Comments. A252864