Properties of the Number 19024

Nineteen Thousand Twenty-Four

Basics

Value: 19023 → 19024 → 19025

Parity: even

Prime: No

Previous Prime: 19013

Next Prime: 19031

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 29 × 41

Divisors: 1, 2, 4, 8, 16, 29, 41, 58, 82, 116

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 100101001010000

Octal: 45120

Duodecimal: B014

Hexadecimal: 4a50

Square: 361912576

Square Root: 137.92751719653333

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

Antidiagonal-sums of the array A377051(n,k) = n-th term of k-th differences of powers of primes. A377052

Numbers m such that ∑_i=1..k (1-1/p_i) + ∏_i=1..k (1-1/p_i) is an integer, where p_i are the k prime factors of m (with multiplicity). A198391

a(n) = (1+n)*(9 + 11·n + 4·n²)/3. A172482

Total sum of the left-to-right minima in all compositions of n into distinct parts. A336770

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = 4^2*(n-1*(k-1)) * ∏_a=1..n-1 ∏_b=1..k-1 (1 - sin(a*π/(2·n))² * sin(b*π/(2·k))²). A340427

a(n) = Pell(n) * A004018(n) for n>=1 with a(0)=1, where A004018(n) is the number of ways of writing n as a sum of 2 squares. A205508

a(n) = A324543(2·A000040(n)). A324549

Numbers k for which A276086(k) == 1 (mod k), where A276086 is the primorial base exp-function. A358231

Expansion of ∏_m>=1 (1-m·q^m)²⁹. A22689

Numerators of continued fraction convergents to sqrt(288). A41542