Properties of the Number -19430

Nineteen Thousand Four Hundred Thirty

Basics

Value: -19431 → -19430 → -19429

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 29 × 67

Divisors: 1, 2, 5, 10, 29, 58, 67, 134, 145, 290

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100101111100110

Octal: -45746

Duodecimal: -B2B2

Hexadecimal: -4be6

Square: 377524900

Square Root: 139.39153489362258

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 ∏_k=1..9 theta₃(q^k), where theta₃() is the Jacobi θ function. A320241

Distinct values of A378664(k) in the order of appearance, when k ranges over those primitively abundant numbers k for which A378664(k) is less than the largest proper divisor of k. A378740

Relative of Hofstadter Q-sequence: a(n) = max(0, n+19395) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0. A283886

Number of isomorphism classes of connected 3-regular loopless simple graphs with n vertices and with semi-edges allowed. A243393

Numbers k such that k-1, k-3, k-7 and k-9 are all prime. A64974

a(n) = 3ⁿ-1+C(2n,n). A81670

Number of partitions of n into 8 parts such that every i-th smallest part (counted with multiplicity) is different from i. A244244

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 0, -1), (0, 1, 1), (1, 0, 0)}. A150173