Properties of the Number -523776

Five Hundred Twenty-Three Thousand Seven Hundred Seventy-Six

Basics

Value: -523777 → -523776 → -523775

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ⁹ × 3 × 11 × 31

Divisors: 1, 2, 3, 4, 6, 8, 11, 12, 16, 22

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: Yes

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1111111111000000000

Octal: -1777000

Duodecimal: -213140

Hexadecimal: -7fe00

Square: 274341298176

Square Root: 723.723704185513

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

Multiply-perfect numbers: n divides σ(n). A7691

a(n) = 2^n-1*(2ⁿ - 1), n >= 0. A6516

3-perfect (triply perfect, tri-perfect, triperfect or sous-double) numbers: numbers such that the sum of the divisors of n is 3n. A5820

a(n) = n² * (n² - 1)/2. A83374

Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 0". A38503

Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 1". A38504

G.f.: 1/((1-2·x)*(1-2·x²)). A122746

Numbers k for which k·gcd(σ(k), A003961(k)) is equal to σ(k) * gcd(k, A003961(k)), where A003961 shifts the prime factorization one step towards larger primes, and σ is the sum of divisors function. A349745

Numbers k such that the set of prime divisors of k is equal to the set of prime divisors of σ(k). A27598

Number of reversible strings with n beads of 2 colors. If more than 1 bead, not palindromic. A32085