Properties of the Number -19339

Nineteen Thousand Three Hundred Thirty-Nine

Basics

Value: -19340 → -19339 → -19338

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 83 × 233

Divisors: 1, 83, 233, 19339

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100101110001011

Octal: -45613

Duodecimal: -B237

Hexadecimal: -4b8b

Square: 373996921

Square Root: 139.06473312813714

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 1/(1 - x*∏_k>=1 1/(1 + k·x^k)). A299210

a(n) = round( γ(n+3/4)/γ(3/4) ). A20041

Ceiling of γ(n+3/4)/γ(3/4). A20131

a(n) = floor(M(g(n-1)+1, ..., g(n))), where M = harmonic mean and g(n) = n³ + n² + n + 1. A227015

Number of partitions of n with rank 5 (the rank of a partition is the largest part minus the number of parts). A363214

Consider trajectory of n under repeated applications of the function f(x) = 'Sum of the prime factors of x (with multiplicity)' (see A029908). Sequence gives composite numbers n that end at a prime m that divides n and m is greater than any m's seen already. A84931

Let M be the matrix defined in A111490. Sequence gives the sum of the elements of the submatrices (from the upper left element): M(1,1); M(1,1)+M(1,2)+M(1,2)+M(2,2); M(1,1)+M(1,2)+M(1,3)+M(2,1)+M(2,2)+M(2,3)+M(3,1)+M(3,2)+M(3,3), etc. A123326

a(n) = 2·A090495(n) - 1. A274297