Properties of the Number -17455

Seventeen Thousand Four Hundred Fifty-Five

Basics

Value: -17456 → -17455 → -17454

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 3491

Divisors: 1, 5, 3491, 17455

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -100010000101111

Octal: -42057

Duodecimal: -A127

Hexadecimal: -442f

Square: 304677025

Square Root: 132.11737205984684

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

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4. A252075

Number of integer partitions of n whose unsigned differences have the same GCD as the GCD of their parts all minus 1. A328164

Number of (n+2)X(3+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4. A252070

Number of (n+2)X(5+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4. A252072

Number of 4Xn 0..1 arrays with every element equal to 0, 1, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303316

Starting with 1,2,3,4,5,6: a(n) is the next smallest number greater than a(n-1) such that a[i] + a[j] + a[k] ≠ a[x] + a[y] + a[z] for 1 <= i,j,k,x,y,z <= n all distinct. A317778

a(n) is the number of free convex polyominoes of n cells. A359661