Properties of the Number -19386

Nineteen Thousand Three Hundred Eighty-Six

Basics

Value: -19387 → -19386 → -19385

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 359

Divisors: 1, 2, 3, 6, 9, 18, 27, 54, 359, 718

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100101110111010

Octal: -45672

Duodecimal: -B276

Hexadecimal: -4bba

Square: 375816996

Square Root: 139.2336166304675

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

Consider the Diophantine equation x³ + y³ = z³ + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y. A50793

Smallest m such that A065623(m) = n. A65624

Numbers n such that the Collatz iterations for n and n + 1 have the same length (A078417) but do not meet a certain condition. (See comments.) A274410

Number of ways to write a + b + c = d + e = f with {a,b,c,d,e,f} a subset of [n] of size 6 and a < b < c and d < e. A362717

a(0) = 1; a(n) = ∑_k=0..n-1 (4·k+1) * a(k) * a(n-k-1). A376087

Number of 13X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2·n² (number of collections of 13 zero-sum 2-vectors with total modulus squared not more than 2·n², ignoring vector and component permutations). A192714

Numbers k such that (5·10^k - 101)/3 is prime. A282506