Properties of the Number -765

Seven Hundred Sixty-Five

Basics

Value: -766 → -765 → -764

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 17

Divisors: 1, 3, 5, 9, 15, 17, 45, 51, 85, 153

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: -1011111101

Octal: -1375

Duodecimal: -539

Hexadecimal: -2fd

Square: 585225

Square Root: 27.65863337187866

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

Values of n such that L(11) and N(11) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227449

Expansion of e.g.f. theta₃^3/2. A15665

Expansion of (∏_j>=1 (1-(-x)^j) - 1)¹⁵ in powers of x. A47640

First differences of A158916. A158926

Expansion of η(q)³ * η(q⁵)⁹ in powers of q. A227901

A Chebyshev transform of the Padovan numbers. A100049

Values of n such that L(5) and N(5) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A226925

Triangle read by rows giving coefficients in Gould's polynomials for counting fountains of coins. A259879

T(n, k) = [x^k] (-2)ⁿ*(B(n, x/2) - B(n, (x+1)/2)) where B(n, x) are the Bernoulli polynomials. Triangle read by rows, for 0 <= k <= n. A333303

sech(arcsinh(x)*cos(x))=1-1/2!*x²+21/4!*x⁴-765/6!*x⁶+53193/8!*x⁸... A12645