Properties of the Number -13641

Thirteen Thousand Six Hundred Forty-One

Basics

Value: -13642 → -13641 → -13640

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 4547

Divisors: 1, 3, 4547, 13641

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11010101001001

Octal: -32511

Duodecimal: -7A89

Hexadecimal: -3549

Square: 186076881

Square Root: 116.7946916601949

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

Numbers that are the sum of 11 positive 8th powers. A3389

T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 4, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A301491

Sum of the fourth largest parts in the partitions of n into 5 parts. A308824

Power ceiling sequence of 2+sqrt(8). A218989

Numbers k such that (5^p - 3^p)/2 is prime, where p = prime(k). A123704

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 58 ones. A31826

Number of 6Xn -1,1 arrays such that the sum over i=1..6,j=1..n of i·x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute n-across galley oarsmen left-right at 6 fore-aft positions so that there are no turning moments on the ship). A225346

Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 4, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A301486

a(n) = ceiling(n*φ¹⁵), where φ is the golden ratio, A001622. A4970

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