Properties of the Number -32155

Thirty-Two Thousand One Hundred Fifty-Five

Basics

Value: -32156 → -32155 → -32154

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 × 59 × 109

Divisors: 1, 5, 59, 109, 295, 545, 6431, 32155

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111110110011011

Octal: -76633

Duodecimal: -16737

Hexadecimal: -7d9b

Square: 1033944025

Square Root: 179.31815301301762

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) = T(n,n), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=0. A26569

Number of ways to write n as an ordered sum of 10 primes. A340966

T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order. A223149

Number of nX2 0..2 arrays with no more than floor(nX2/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order. A223144

Total number of corners in all partitions of n. A corner of a partition is a point of degree two in the corresponding Ferrers diagram. A265258

The indices k where A377015(k) = 1. A377928

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), (1, -1, 0), (1, 0, 0), (1, 0, 1)}. A149902