Properties of the Number 54024

Fifty-Four Thousand Twenty-Four

Basics

Value: 54023 → 54024 → 54025

Parity: even

Prime: No

Previous Prime: 54013

Next Prime: 54037

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 2251

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 2251, 4502

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101001100001000

Octal: 151410

Duodecimal: 27320

Hexadecimal: d308

Square: 2918592576

Square Root: 232.43063481391604

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

Triangle read by rows: T(n,m) (n >= m >= 1) = number of line segments formed by drawing the lines connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares. A331454

Number of length n+5 0..5 arrays with some three disjoint pairs in each consecutive six terms having the same sum. A248486

a(n) = s(n) - prime(n+1)+3, where s(n) = smallest even number x > prime(n) such that the difference x-p is composite for all primes p <= prime(n). A298736

Reversion of 1 / sqrt(1 - 4·x) (the o.g.f. for the central binomial coefficients A000984) as if it were an e.g.f. A66397

Sum of the divisors of n reduced modulo n. A54024

T(n,k)=Number of length n+5 0..k arrays with some three disjoint pairs in each consecutive six terms having the same sum. A248489

E.g.f. A(x) satisfies: 1-x = ∑_n>=0 Laplace(A(x)ⁿ) * (-x)ⁿ. A213058

Primes p such that A001175(p) = 2*(p+1)/7. A308785

E.g.f. A(x) satisfies: ∑_k=0..n [x^k/k!] 1/A(x)^n+1-k = 0 for n > 0. A351919