Properties of the Number -49764

Forty-Nine Thousand Seven Hundred Sixty-Four

Basics

Value: -49765 → -49764 → -49763

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 11 × 13 × 29

Divisors: 1, 2, 3, 4, 6, 11, 12, 13, 22, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1100001001100100

Octal: -141144

Duodecimal: -24970

Hexadecimal: -c264

Square: 2476455696

Square Root: 223.07846153315654

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

Number of 5-bead necklaces of n colors not allowing reversal, with no adjacent beads having the same color. A208536

Antidiagonal sums of the convolution array A213505. A213547

Expansion of x/((1-x)³*(1-x²)³*(1-x³)). A164680

Numbers k such that ω(k) = 5 and the largest prime factor of k equals the sum of its remaining distinct prime factors, where ω(k) = A001221(k). A383729

Numbers k such that σ(k - 2) = σ(k + 2). A223091

Number of aperiodic necklaces of n beads of 12 colors. A32167

G.f. for Ehrhart quasi-polynomials for hyperplane arrangements of type E₆. A210634

Product of Fibonacci and Catalan numbers: a(n) = A000045(2·n+2)*A000108(n). A215931

Numbers n such that 13ⁿ is the highest power of 13 dividing A240751(n). A286007

Numbers k such that the sum of the proper divisors of k that have the same binary weight as k is larger than k, and no subset of these divisors sums to k. A381071