Properties of the Number 19630

Nineteen Thousand Six Hundred Thirty

Basics

Value: 19629 → 19630 → 19631

Parity: even

Prime: No

Previous Prime: 19609

Next Prime: 19661

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 13 × 151

Divisors: 1, 2, 5, 10, 13, 26, 65, 130, 151, 302

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100110010101110

Octal: 46256

Duodecimal: B43A

Hexadecimal: 4cae

Square: 385336900

Square Root: 140.10710188994705

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

G.f. A(x) satisfies: A(x)³ = A( x³/(1-3·x) ), with A(0) = 0. A264228

a(n) = (n - 1)*(n² + n - 1). A33445

a(n) = A064835(n)/2. A64836

Number of regular graphs on n unlabeled nodes with half-edges. A333162

Numerator of Euler(n, 1/27). A157091

Number of nondecreasing arrangements of n+2 numbers in 0..7 with each number being the sum mod 8 of two others. A183910

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

T(n,k)=Number of nondecreasing arrangements of n+2 numbers in 0..k with each number being the sum mod (k+1) of two others. A183912

Sum of the sixth powers of the parts in the partitions of n into two distinct parts. A294301

Expansion of g.f. A(x) satisfying A(x)³ + x⁴/A(x)³ = A(x³) + x⁴/A(x³) - 3·x². A370446