Properties of the Number -35841

Thirty-Five Thousand Eight Hundred Forty-One

Basics

Value: -35842 → -35841 → -35840

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 13 × 919

Divisors: 1, 3, 13, 39, 919, 2757, 11947, 35841

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1000110000000001

Octal: -106001

Duodecimal: -188A9

Hexadecimal: -8c01

Square: 1284577281

Square Root: 189.3171941478111

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

Triangle T(n,k) read by rows: T(n,k) is the number of length-n ascent sequences with exactly k descents. A238858

Number of vertices formed in a square by straight line segments when connecting the four corner vertices to the points dividing the sides into n equal parts. A355949

Expansion of 1/((1-x)³ (1-x²)² (1-x³) (1-x⁴)). A2626

Numerators of continued fraction convergents to sqrt(662). A42272

Number of ascent sequences of length n with exactly five descents. A241875

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

a(n) = T(6,n), array T given by A048472. A48478

Number of sequences of n coin flips, that win on the last flip, if the sequence of flips ends with (1,1,0) or (1,0,1). A196382

Numbers k such that σ(k)² is divisible by k-1. A344347