Properties of the Number -17853

Seventeen Thousand Eight Hundred Fifty-Three

Basics

Value: -17854 → -17853 → -17852

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 11 × 541

Divisors: 1, 3, 11, 33, 541, 1623, 5951, 17853

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100010110111101

Octal: -42675

Duodecimal: -A3B9

Hexadecimal: -45bd

Square: 318729609

Square Root: 133.61511890501015

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

Table T(n,k) is the number of n X (k+1) 0..1 arrays with every row least squares fitting to a positive-slope straight line and every column least squares fitting to a zero- or positive-slope straight line, with a single point array taken as having zero slope, read by downward antidiagonals. A222969

a(n) = ∑_{i=1..A328404(n)} (A276086(n) mod prime(i))*A002110(i-1), where A276086 is the primorial base exp-function, and A328404(n) gives the length of A276086(n) in primorial base representation. A391936

Number of Catalan knight paths from (0,0) to (n,1) in the region between and on the lines y=0 and y=3. (See A096587 for the definition of Catalan knight.). A99329

Number of (n+1) X 2 0..2 arrays with every row and column least squares fitting to a positive slope straight line. A222843

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) - 3·b(n-3), where a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences. A295360

G.f. satisfies A(x) = exp( ∑_k>=1 (3 * (-1)^k + A(x^k)) * x^k/k ). A363566

Partial sums of round(Fibonacci(n)/11). A179111

Least number k such that 3^k begins with exactly n identical digits. A235869

a(n) = ∑_m=0..n ∑_i=0..m i·C(m-i,i)*C(m-i,n-m-i). A298371

Number of partitions in parts not of the form 23k, 23k+3 or 23k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 10 are greater than 1. A35991