Properties of the Number 19445

Nineteen Thousand Four Hundred Forty-Five

Basics

Value: 19444 → 19445 → 19446

Parity: odd

Prime: No

Previous Prime: 19441

Next Prime: 19447

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 3889

Divisors: 1, 5, 3889, 19445

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 100101111110101

Octal: 45765

Duodecimal: B305

Hexadecimal: 4bf5

Square: 378108025

Square Root: 139.44532978913278

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

a(n) = least k such that the remainder when 23^k is divided by k is n. A128363

Number of multisets of positive integers whose right half (exclusive) sums to n. A360673

Numbers k such that 2^k + 2·k + 1 is prime. A301634

Indices of primes in sequence defined by A(0) = 77, A(n) = 10·A(n-1) - 3 for n > 0. Numbers n such that (690·10ⁿ + 3)/9 is prime. A56260

Number of permutations in S_n avoiding {bar 1}3245 (i.e., every occurrence of 3245 is contained in an occurrence of a 13245). A137543

a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 4) so far). A60731

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), (0, 0, -1), (0, 1, 0), (1, 0, 0), (1, 1, 1)}. A151145

Form a permutation of the positive integers, p₁, p₂, ..., such that the average of each initial segment is an integer, using the greedy algorithm to define p_n; sequence gives p₁ + ... + p_n. A19445