Properties of the Number -32522

Thirty-Two Thousand Five Hundred Twenty-Two

Basics

Value: -32523 → -32522 → -32521

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 × 23 × 101

Divisors: 1, 2, 7, 14, 23, 46, 101, 161, 202, 322

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111111100001010

Octal: -77412

Duodecimal: -169A2

Hexadecimal: -7f0a

Square: 1057680484

Square Root: 180.3385704723202

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

Relative of Hofstadter Q-sequence: a(n) = max(0, n+32478) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0. A274058

Sum of the largest parts of the partitions of n into 8 squarefree parts. A326452

n times n+4 gives the concatenation of two numbers m and m-6. A116248

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2)*b(n-1)*b(n), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296279

Sum of successive integers in a row of length p(n) where p counts integer partitions. A373300

a(1) = 1 and thereafter a(n) = a(n-1) + j(n-1) where j(1) = 1 and then j(n) = j(n-1)-1 if a(n) is composite or j(n) = 2·j(n-1) if a(n) is prime. A382671