Properties of the Number -13320

Thirteen Thousand Three Hundred Twenty

Basics

Value: -13321 → -13320 → -13319

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 5 × 37

Divisors: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11010000001000

Octal: -32010

Duodecimal: -7860

Hexadecimal: -3408

Square: 177422400

Square Root: 115.41230437002807

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) = n*(5·n² - 2)/3. A4466

Smallest palindromic numbers of length 4 in two bases differing by n. A216843

Numbers k such that 13^k - 2 is a prime. A128457

Number of partitions of n such that the number of odd parts is not a part and the number of even parts is not a part. A240579

Numbers k such that σ (x) = k has exactly 11 solutions. A60678

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than plus two, zero or minus 1. A269619

T(n,k)=Number of length-n 0..k arrays with every repeated value unequal to the previous repeated value plus one mod k+1. A269776

Integers that occur more than once as the difference of the squares of two consecutive primes. A78667

a(n) = ∑_k=1..n T(n,k), array T as in A049790. A49791

From a Fibonacci-like differential equation. A5445