Properties of the Number -13039

Thirteen Thousand Thirty-Nine

Basics

Value: -13040 → -13039 → -13038

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 13 × 17 × 59

Divisors: 1, 13, 17, 59, 221, 767, 1003, 13039

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11001011101111

Octal: -31357

Duodecimal: -7667

Hexadecimal: -32ef

Square: 170015521

Square Root: 114.18844074598795

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

"Real rabbits": a(n) = Re(c(n)) where complex c(n) = a(n) + i·b(n) and c(0) = i, c(1) = -i, c(n) = c(n-1) + i·c(n-2). A58184

Expansion of e.g.f. tanh(sinh(x)+tan(x)) (odd powers only). A13051

Multiples of 13 containing a 13 in their decimal representation. A121033

Define E(n) = ∑_k>=0 (-1)^floor(k/3)*kⁿ/k! for n = 0,1,2,... . Then E(n) is an integral linear combination of E(0), E(1) and E(2). This sequence lists the coefficients of E(1). A143629

Number of partitions of n into parts not of the form 13k, 13k+4 or 13k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 5 are greater than 1. A35952

T(n,n-4), where T is the array in A055830. A55831

Smallest m such that A070965(m) = n. A227953

Numbers n such that φ(3n-1) = σ(n). A67232

Numbers m such that the positive values of m - A002110(k) are all primes (k > 0). A68372

Numbers n such that n·2¹²⁷⁹ - 1 is prime. A265502