Properties of the Number 18484

Eighteen Thousand Four Hundred Eighty-Four

Basics

Value: 18483 → 18484 → 18485

Parity: even

Prime: No

Previous Prime: 18481

Next Prime: 18493

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 4621

Divisors: 1, 2, 4, 4621, 9242, 18484

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100100000110100

Octal: 44064

Duodecimal: A844

Hexadecimal: 4834

Square: 341658256

Square Root: 135.95587519485872

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 of proper divisors of Catalan number A000108(n). A152762

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k pyramids (a pyramid is a sequence u^pd^p or U^pd^2p for some positive integer p, starting at the x-axis). A108445

Number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having no pyramids (a pyramid is a sequence u^pd^p or U^pd^2p for some positive integer p, starting at the x-axis). A108449

Expansion of f(-x, x²) / f(-x, -x³)³ in powers of·where f(, ) is Ramanujan's general θ function. A263993

Wiener indices of Fibonacci trees of order k. A165910

Number of 2n-digit primes that are concatenation of n two-digit distinct primes p₁...p_n, 98>p₁>p₂>...>p_n>10. A168513

Expansion of f(x, x²) / ψ(x)³ in powers of·where ψ(), f(, ) are Ramanujan θ functions. A258092

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having sum of the heights of its pyramids equal to k (a pyramid is a sequence u^pd^p or U^pd^2p for some positive integer p, starting at the x-axis; p is the height of the pyramid). A109157

G.f. satisfies: A(x) = ∑_n>=0 xⁿ*[∑_k=0..n C(n,k)² *x^k* A(x)^2k]. A183876

Numbers whose binary representation traces a closed circuit in honeycomb lattice when its bits, from the least to the second most significant bit, are interpreted as directions to proceed at each vertex. (The most significant 1-bit is ignored). A255570