Properties of the Number 19513

Nineteen Thousand Five Hundred Thirteen

Basics

Value: 19512 → 19513 → 19514

Parity: odd

Prime: No

Previous Prime: 19507

Next Prime: 19531

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 × 19 × 79

Divisors: 1, 13, 19, 79, 247, 1027, 1501, 19513

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110000111001

Octal: 46071

Duodecimal: B361

Hexadecimal: 4c39

Square: 380757169

Square Root: 139.68894014917572

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

Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1. A73

Hexagonal prism numbers: a(n) = (n + 1)*(3·n² + 3·n + 1). A5915

Number of simple graphs covering {1..n} with no crossing or nesting edges. A326329

Consider all quadruples {a,b,c,d} which reach {k,k,k,k} in n steps under map {a,b,c,d}->{|a-b|,|b-c|,|c-d|,|d-a|}; look at max{a,b,c,d}; sequence gives minimal value of this. A45794

Minimum value t such that all quadruples of Diffy_length >= n have a maximal value >= t. A65678

Tribonacci sequences A000073 and A001590 interleaved. A213816

Number of partitions p of n such that median(p) >= multiplicity(min(p)). A240216

a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073. A73717

Products of three distinct happy primes A035497. A154717

a(n) = T(3n+1), where T(n) are tribonacci numbers A000073. A74581