Properties of the Number 24138

Twenty-Four Thousand One Hundred Thirty-Eight

Basics

Value: 24137 → 24138 → 24139

Parity: even

Prime: No

Previous Prime: 24137

Next Prime: 24151

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ⁴ × 149

Divisors: 1, 2, 3, 6, 9, 18, 27, 54, 81, 149

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101111001001010

Octal: 57112

Duodecimal: 11B76

Hexadecimal: 5e4a

Square: 582643044

Square Root: 155.36408851468863

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

Number of modes of connections of 2n points. A6605

Decimal part of cube root of n starts with 9: first term of runs. A34135

Triangular array generated by its row sums: T(n,0) = 1 for n >= 0, T(n,1) = r(n-1), T(n,k) = T(n,k-1) - (-1)^k * r(n-k) for k = 2, 3, ..., n, n >= 2, r(h) = sum of the numbers in row h of T. A54090

Sum of the cubes of the parts in the partitions of n into two parts. A294270

McKay-Thompson series of class 19A for Monster. A58549

G.f. satisfies: A(x) = 1 + x·A(x)*A(-x) + x²*A(x)²*A(-x)². A143926

McKay-Thompson series of class 19A for the Monster group with a(0) = 3. A136569

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0ⁿ and T(n,k) = k * ∑_r=0..n binomial(2·n+k,r) * binomial(r,n-r)/(2·n+k) for k > 0. A378292

Numbers k such that the powerful part of the sum of divisors of k (A387726) is greater than or equal to k, and σ(k) is not itself a powerful number. A387729

Array of coefficients A(n,k) of the formal power series P(n,x) read by upwards antidiagonals, where P(n,x) = ∑_k>=0 A(n,k)*x^k = 1+x·P(n,x)^1·n+x²*P(n,x)^2·n for n >= 0. A261440