Properties of the Number -13615

Thirteen Thousand Six Hundred Fifteen

Basics

Value: -13616 → -13615 → -13614

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 × 7 × 389

Divisors: 1, 5, 7, 35, 389, 1945, 2723, 13615

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11010100101111

Octal: -32457

Duodecimal: -7A67

Hexadecimal: -352f

Square: 185368225

Square Root: 116.68333214302719

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

Coefficient of·in minimal polynomial of the continued fraction [1ⁿ,5,1,1,1,...], where 1ⁿ means n ones. A265805

a(n) = -(n + 1)*(2·n² + n - 12)/6. A58372

Numbers k such that 2^k + 9 is prime. A57196

Numbers k that, when expressed in base 7 and then interpreted in base 10, give a multiple of k. A62944

Triangle, read by rows, equal to the matrix cube of A113370. A113378

Numbers that, when expressed in base 7 and then interpreted in base 10, yield a multiple of the original number. A32549

Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n. A76164

Numbers k such that k divides 1 + ∑_j=1..k prime(j)¹⁹. A233768

Numbers that are the concatenation of three (not necessarily distinct) primes whose sum is prime, and are also the product of three (not necessarily distinct) primes whose sum is prime. A385452

If M(n) is the n-th Mersenne prime, then a(n) is the smallest positive integer such that 2·a(n)*M(n)*M(n+1)*M(n+2)-1 is prime. A93192