Properties of the Number 36861

Thirty-Six Thousand Eight Hundred Sixty-One

Basics

Value: 36860 → 36861 → 36862

Parity: odd

Prime: No

Previous Prime: 36857

Next Prime: 36871

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 11 × 1117

Divisors: 1, 3, 11, 33, 1117, 3351, 12287, 36861

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1000111111111101

Octal: 107775

Duodecimal: 193B9

Hexadecimal: 8ffd

Square: 1358733321

Square Root: 191.9921873410478

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

Number of partitions of n such that (number of distinct parts) >= least part. A239952

G.f. satisfies: A(x) = (1 + x + x²) * A(x²)⁴. A237648

Number of nX3 0..1 arrays with every element unequal to 0, 2, 3 or 5 king-move adjacent elements, with upper left element zero. A304005

Number of 4-tuples of nonnegative integers less than p for which 4-argument multinomial coefficients support a Lucas congruence modulo p², where p is the n-th prime. A348886

Let u(1)=u(2)=1, u(3)=n, u(k) = (1/2)*abs(2·u(k-1) -u(k-2)-u(k-3)); sequence gives values of n such that ∑_k>=1 u(k) is an integer. A78113

a(n) = 1 + Sum(prime(i)*(2·i-1): 1<=i<=n). A83215

Twin prime products minus 2. A124659

Number of partitions of n such that cn(1,5) < cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5). A36861