Properties of the Number -1013760

Thirteen Thousand Seven Hundred Sixty

Basics

Value: -1013761 → -1013760 → -1013759

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ¹¹ × 3 ² × 5 × 11

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11110111100000000000

Octal: -3674000

Duodecimal: -40A800

Hexadecimal: -f7800

Square: 1027709337600

Square Root: 1006.8564942433455

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 T(n, k) = H(n, k+1) - 2·H(n, k) - H(n, k-1), where H(n, k) = A060821(n+3, k), read by rows. A140873

a(n) = (n³ - n)*2ⁿ. A128960

Number of strings over Z₄ of length n with trace 2 and subtrace 2. A68790

1-quantum transitions in systems of N spin 1/2 particles, in columns by combination indices. Triangle read by rows, T(n, k) for n >= 1 and 0 <= k <= floor((n-1)/2). A213343

Droll numbers: numbers > 1 whose sum of even prime factors equals the sum of odd prime factors. A19507

a(n) = A203418(n)/A000178(n). A203420

The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1, no self-adjacent terms, and a minimal product (= A282170(n)). A284436

a(n) = φ(A291789(n)). A291805

a(n) = ∑_{k=0..floor(n/3)} 2^k * 3^n-3·k * binomial(k,3*(n-3·k)). A392042

Expansion of e.g.f. x⁴*exp(x)². A52796