Properties of the Number -13507

Thirteen Thousand Five Hundred Seven

Basics

Value: -13508 → -13507 → -13506

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 13 × 1039

Divisors: 1, 13, 1039, 13507

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -11010011000011

Octal: -32303

Duodecimal: -7997

Hexadecimal: -34c3

Square: 182439049

Square Root: 116.21961968617863

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

a(n) = floor( γ(n + 1/5)/γ(1/5) ). A20085

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 310", based on the 5-celled von Neumann neighborhood. A281038

a(n) = round( γ(n+1/5)/γ(1/5) ). A20040

Number of partitions p of n such that m(p) = m(c(p)), where m = maximal multiplicity of parts, and c = conjugate. A240728

a(n) = n³ mod (n-th prime squared). A167623

a(0) = 1; thereafter a(n) = 10·n² - 5·n + 2. A383466

Difference between ceiling(e^{n/2 - 1}) (A005181) and the n-th Fibonacci number (A000045). A96766

6n-1,6n+1, 6n+5, 6n+7 are all primes. That is they are adjacent pairs of twin primes. A178145

Number of 2Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 2Xn array. A219829

Triangle read by rows: T(n,k) = number of k-classes of permutations of n letters avoiding the pattern 132 (n>=1, 0 <= k <= n-1). A261665