Properties of the Number 19405

Nineteen Thousand Four Hundred Five

Basics

Value: 19404 → 19405 → 19406

Parity: odd

Prime: No

Previous Prime: 19403

Next Prime: 19417

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 3881

Divisors: 1, 5, 3881, 19405

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 100101111001101

Octal: 45715

Duodecimal: B291

Hexadecimal: 4bcd

Square: 376554025

Square Root: 139.30183056945089

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

Composites whose prime factorization in base 8 is an anagram of the number in base 8. A260052

Third row of Pascal-(1,5,1) array A081580. A81589

Least k such that prime(n)² divides binomial(2k,k). A110494

a(1)=1, a(2)=2; for n >= 2, a(n+1) = a(n) + sum of prime factors of a(n). A96461

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

Sums of 5 distinct powers of 5. A38477

Sequence is {a(5,n)}, where a(m,n) is defined at sequence A110665. A110670

Number of self-avoiding polygons with perimeter n and sides = 1 that have vertex angles from the set 0, +-π/5, +-2*π/5, +-3*π/5, +-4*π/5, not counting rotations and reflections as distinct. A316200

Number of partitions p of n such that min(p) <= (number of parts of p) <= max(p). A325343

Triangle read by rows: T(n,k) number of ways of partitioning the (n+3)-element multiset {1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 3. A291118