Properties of the Number -32368

Thirty-Two Thousand Three Hundred Sixty-Eight

Basics

Value: -32369 → -32368 → -32367

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 7 × 17 ²

Divisors: 1, 2, 4, 7, 8, 14, 16, 17, 28, 34

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111111001110000

Octal: -77160

Duodecimal: -16894

Hexadecimal: -7e70

Square: 1047687424

Square Root: 179.91108915239215

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

Reversion of y - y² + y⁴ + y⁵. A63034

Number of ways to place 2 nonattacking queens on an n X n toroidal board. A172517

a(n) = 28·n². A64763

Number of iterations of A268395 needed to reach zero from 2ⁿ: a(n) = A268708(2ⁿ). A268709

Number of iterations of A268395 needed to reach zero from 2ⁿ + 1: a(n) = A268708(2ⁿ + 1). A268710

a(n) = spt(5n+4)/5 where spt(n) = A092269(n). A220505

a(n) = ((n + 1)² * (5·n + 4)*n) / 12. A368046

Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = 3. A380924

Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0. A96554

Numbers n such that n² is divisible by the sum of the distinct prime divisors of n² + 1. A196219