Properties of the Number 25410

Twenty-Five Thousand Four Hundred Ten

Basics

Value: 25409 → 25410 → 25411

Parity: even

Prime: No

Previous Prime: 25409

Next Prime: 25411

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 7 × 11 ²

Divisors: 1, 2, 3, 5, 6, 7, 10, 11, 14, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110001101000010

Octal: 61502

Duodecimal: 12856

Hexadecimal: 6342

Square: 645668100

Square Root: 159.4051442080838

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

a(1)=1, a(2)=2; thereafter, a(n) is the smallest number m not yet in the sequence such that every prime that divides a(n-1) also divides m. A60735

A run-length describing inverse to A181819. The multiplicity of prime(k) in a(n) is the k-th smallest prime index of n, which is A112798(n,k). A304660

Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children. A94262

a(n) is the smallest number k such that r·k + 1 is prime for all r = 1 to n. A88250

T(n,k)=Number of nXk 0..3 arrays with rows unimodal and columns nondecreasing. A223987

Numbers with exactly 5 distinct prime divisors {2,3,5,7,11}. A147572

Intersection of A055932 and A014574. A384530

Triangle T(n,k) read by rows in which n-th row lists in increasing order all compositions [c₁, c₂, ..., c_q] of n encoded as ∏_i=1..q prime(i)^c_i; n>=0, 1<=k<=A011782(n). A324939

a(n) = (n/(n+1)) * lcm(1,2,...,n+1). A25558

Triangle T(n,k) of number of minimal 4-covers of a labeled n-set that cover k points of that set uniquely (k=4,..,n). A57965