Properties of the Number -32505

Thirty-Two Thousand Five Hundred Five

Basics

Value: -32506 → -32505 → -32504

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 11 × 197

Divisors: 1, 3, 5, 11, 15, 33, 55, 165, 197, 591

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111111011111001

Octal: -77371

Duodecimal: -16989

Hexadecimal: -7ef9

Square: 1056575025

Square Root: 180.29143074478054

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

Second partial sums of fourth powers (A000583). A101089

G.f.: A(x) = 1 + x*(1 + x*(1 + x*(...(1 + x*(...)^2n-1)...)⁵)³)¹. A138211

a(n) = ∑_{k=0..floor(4·n/7)} binomial(k+3,4·n-7·k). A390039

a(n) in base 14 is a repdigit. A48338

a(n) = 1·9ⁿ + 2·8ⁿ + 3·7ⁿ + 4·6ⁿ + 5·5ⁿ + 6·4ⁿ + 7·3ⁿ + 8·2ⁿ + 9·1ⁿ. A254147

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 931", based on the 5-celled von Neumann neighborhood. A273790

a(n) = ∑_k=0..n binomial(k, 7*(n-k)). A306721

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (0, 1, -1), (1, 0, 0), (1, 1, 1)}. A150464