Properties of the Number -32769

Thirty-Two Thousand Seven Hundred Sixty-Nine

Basics

Value: -32770 → -32769 → -32768

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 11 × 331

Divisors: 1, 3, 9, 11, 33, 99, 331, 993, 2979, 3641

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000000000000001

Octal: -100001

Duodecimal: -16B69

Hexadecimal: -8001

Square: 1073807361

Square Root: 181.02209809854708

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

a(n) = (-2·I)ⁿ + (2·I)ⁿ + (1/2 + 1/2·I*sqrt(3))ⁿ + (1/2 - 1/2·I*sqrt(3))ⁿ. A153265

Dirichlet inverse of A005941. A364574

a(2·n) = -(2^2·n+1 + 1), a(2·n+1) = (2ⁿ⁺¹ - (-1)ⁿ)². A105951

A sequence of triples arising from a matrix calculation, in particular let m = floor(n/3), then (a(3·m), a(3·m+1), a(3·m+2)) = M^m*(m+1/n) * (0, 1, 1) where M is the matrix [[2,0,1], [0,1,0], [-2,1,0]]. A103193

Expansion of e.g.f. (1 + sin(x))/exp(x). A321632

Dirichlet inverse of function f(n) = 1 + A048675(n), where A048675(n) is fully additive with a(p) = 2^1-PrimePi(p). A359795

a(n) = 2ⁿ + 1. A51

Numbers that are the sum of 2 positive 5th powers. A3347

a(0) = 1; for n>0, a(n) = 2ⁿ + 1. A83318

a(n) = 8ⁿ + 1. A62395