Properties of the Number 25483

Twenty-Five Thousand Four Hundred Eighty-Three

Basics

Value: 25482 → 25483 → 25484

Parity: odd

Prime: No

Previous Prime: 25471

Next Prime: 25523

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 17 × 1499

Divisors: 1, 17, 1499, 25483

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110001110001011

Octal: 61613

Duodecimal: 128B7

Hexadecimal: 638b

Square: 649383289

Square Root: 159.6339562875017

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

G.f.: ∑_n>=0 xⁿ * (1+x)^n². A121689

Sum of the first moments of all partitions of n with weights starting at 0. A66185

G.f.: A(x,y) = ∑_n>=0 xⁿ * ((1+x)ⁿ + y)ⁿ, where A(0) = 0, as a triangle of coefficients T(n,k) of xⁿ*y^k in A(x,y) = ∑_n>=0 xⁿ * ∑_k=0..n T(n,k)*xⁿ*y^k, read by rows. A325580

Expansion of ∑_k>0 x^k / (1 - 2·x^k)^k+1. A360797

G.f. A(x) satisfies: ∑_n>=0 xⁿ*A(x)^n*(n+1/2) = ∑_n>=0 xⁿ*(1+x)^n². A325289

Odd numbers n such that σ(n) is divisible by 5. A274685

Number of tilings of a 4 X n rectangle using dominoes and trominoes (of any shape). A364155

Number of (n+2)X(1+2) 0..2 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order. A252877

G.f.: [ ∑_n>=0 xⁿ * (1+x)^n² ] * [ ∑_n>=0 xⁿ / (1+x)^n² ]. A320950

G.f. A(x) satisfies: ∑_n>=0 x^n² * A(x)ⁿ = ∑_n>=0 xⁿ * (1+x)^n². A337850