Properties of the Number -3815

Eight Hundred Fifteen

Basics

Value: -3816 → -3815 → -3814

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 7 × 109

Divisors: 1, 5, 7, 35, 109, 545, 763, 3815

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111011100111

Octal: -7347

Duodecimal: -225B

Hexadecimal: -ee7

Square: 14554225

Square Root: 61.765686266729034

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 read by rows. T(n, k) = ∑_j=k..n binomial(n, j) * (-j)^{n - j} * (-1)^{j - k}* A360177(j, k). A360176

a(n) = ∑_k=0..n binomial(n, k)² * (k - n)^k. A367273

a(n) = ∑_{d divides n} q(d), where q(d) = A000009 = number of partitions of d into distinct parts. A47966

Number of Golomb partitions of n. A325858

a(n) = coefficient of xⁿ in A(x) such that x = ∑_n=-oo..+oo x^n*(3·n+1/2) * (A(x)^3·n - 1/A(x)^3·n+1). A359920

a(n) = n*(3·n + 4). A140676

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the smallest integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = a(3) = 1. A50024

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

Numbers k such that 2^k+1 == 1 (mod k). A187787

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 1. A50040