Properties of the Number -12380

Twelve Thousand Three Hundred Eighty

Basics

Value: -12381 → -12380 → -12379

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 × 619

Divisors: 1, 2, 4, 5, 10, 20, 619, 1238, 2476, 3095

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11000001011100

Octal: -30134

Duodecimal: -71B8

Hexadecimal: -305c

Square: 153264400

Square Root: 111.26544836560899

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

Expansion of g.f. A(x) satisfying A(x) = ∑_n>=0 dⁿ/dxⁿ x^2·n * A(x)^3·n / n!. A360975

T(n,k)=Number of length-n 0..k arrays with no repeated value greater than or equal to the previous repeated value. A269409

Number of sequences of length n that cover an initial interval of positive integers and are both a reversed Lyndon word and a co-Lyndon word. A334270

For any k, the cumulative sum a(1) + a(2) + a(3) + ... + a(k) shares at least five digits with a(k). Lexicographically first sequence of positive integers without duplicate terms having this property. A326640

First differences of A116084. A116085

Number of triangles on a 4 X n grid. A296367

Smallest number k such that A270172(k) = n. A270173

Total number of Fibonacci parts in all compositions of n. A309537

a(n) = ∑_k=0..n (k+1) * 2^n-k * binomial(2·k+1,2·n-2·k). A391893

a(n) = floor(3rd elementary symmetric function of ∑_j=1..k 1/j, k = 1,2,...,n). A25213