Properties of the Number -19965

Nineteen Thousand Nine Hundred Sixty-Five

Basics

Value: -19966 → -19965 → -19964

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 11 ³

Divisors: 1, 3, 5, 11, 15, 33, 55, 121, 165, 363

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100110111111101

Octal: -46775

Duodecimal: -B679

Hexadecimal: -4dfd

Square: 398601225

Square Root: 141.2975583653164

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

Number of inequivalent ways to color vertices of a regular tetrahedron using <= n colors. A6008

Third accumulation array, T, of the natural number array A000027, by antidiagonals. A185508

a(n) is the maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to square with coordinates <= n. A242514

Number of partitions of n into parts not of the form 15k, 15k+2 or 15k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 6 are greater than 1. A35956

Odd n such that 2*φ(n) < n, but there does not exist an even k < n with φ(k) = φ(n). A118700

a(n) = number of knight's move paths of minimal length n steps, from origin at center of an infinite open chessboard to square (0,0) for n=0; to square (2,-1) for n=1; and to square ([(3n-3)/2], [(3n-4)/2]) for n>=2. A242512

a(n) = ((n-th prime)⁵-(n-th prime)³)/8. A138436

G.f. A(x) satisfies: 1 = ∑_n>=0 (-x)ⁿ * A(x)^3·n * A(x·A(x)ⁿ). A352855

Numbers divisible by prime(d) for each digit d in their base-6 representation, none of which may be zero. A256876

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) + n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296556