Properties of the Number -5775

Seven Hundred Seventy-Five

Basics

Value: -5776 → -5775 → -5774

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: Yes

Factorization: 3 × 5 ² × 7 × 11

Divisors: 1, 3, 5, 7, 11, 15, 21, 25, 33, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1011010001111

Octal: -13217

Duodecimal: -3413

Hexadecimal: -168f

Square: 33350625

Square Root: 75.99342076785332

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

Inversion of e.g.f. formal power series. Partition array in Abramowitz-Stegun (A-St) order. A176740

Triangle t(n,m)= binomial(n+m-1,n-1) + binomial(2·n-m-1,n-1) -binomial(2·n-1,n-1) read by rows, 0<=m<=n. A174952

a(n+2) = a(n+1) + a(n) + A·tⁿ, with A = 1 and t = -2. A224508

a(0)=a(1)=a(2)=0, a(3)=1; thereafter a(n) = 4a(n-3)-5a(n-4). A178219

Numbers k that divide the (right) concatenation of all numbers <= k written in base 25 (most significant digit on left). A29470

Prime factorization representation of Stern polynomials: a(0) = 1, a(1) = 2, a(2n) = A003961(a(n)), a(2n+1) = a(n)*a(n+1). A260443

Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m). A5231

Expansion of ∏_m>=1 (1 + m·q^m). A22629

a(n) = 4·n² - 1. A466

Numbers k such that both k and k+1 are abundant. A96399