Properties of the Number 24324

Twenty-Four Thousand Three Hundred Twenty-Four

Basics

Value: 24323 → 24324 → 24325

Parity: even

Prime: No

Previous Prime: 24317

Next Prime: 24329

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 2027

Divisors: 1, 2, 3, 4, 6, 12, 2027, 4054, 6081, 8108

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101111100000100

Octal: 57404

Duodecimal: 120B0

Hexadecimal: 5f04

Square: 591656976

Square Root: 155.9615337190552

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

Sum over all Dyck paths of semilength n of products over all peaks p of x_p², where x_p is the x-coordinate of peak p. A258178

Width of the bit-masks A068221 & A068222 (number of digits in A068223 & A068224). A68739

Minimal m such that nⁿ-m and nⁿ+m are both primes, or -1 if there is no such m. A75468

a(n) = 169·n² - n. A157998

a(n) = 676·n² - 2·n. A158392

a(n) = 144·n² - 12. A158543

a(n) is the number of smallest parts in the overpartitions of n. A335724

Smallest k such that p^p -+ k is prime, where p=prime(n). A157719

Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined. A15128

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = A000201 (lower Wythoff sequence). A24324