Properties of the Number 25527

Twenty-Five Thousand Five Hundred Twenty-Seven

Basics

Value: 25526 → 25527 → 25528

Parity: odd

Prime: No

Previous Prime: 25523

Next Prime: 25537

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 67 × 127

Divisors: 1, 3, 67, 127, 201, 381, 8509, 25527

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001110110111

Octal: 61667

Duodecimal: 12933

Hexadecimal: 63b7

Square: 651627729

Square Root: 159.7717121395399

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 integer partitions of n that are either constant or relatively prime. A338553

Numbers k such that k - A067666(k) is a square. A386304

Square roots of partial sums of A386369 that are square numbers. A386370

Expansion of 1/(1-x³-x⁴-x⁵-x⁶-x⁷-x⁸-x⁹-x¹⁰-x¹¹-x¹²-x¹³). A17826

G.f.: M(F(x)) is a power series in·consisting entirely of positive integer coefficients such that M(F(x) - x^k) has negative coefficients for k>0, where M(x) = 1 + x·M(x) + x·M(x)² is the g.f. of the Motzkin numbers A001006. A251571

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 0, 1), (0, 1, 0), (1, 1, -1)}. A150204

a(n) = n!/lcm{1,2,...,n} = (n-1)!/lcm{C(n-1,0), C(n-1,1), ..., C(n-1,n-1)}. A25527

a(n) = n¹⁰ + 9·n⁹ + 53·n⁸ + 218·n⁷ + 695·n⁶ + 1754·n⁵ + 3572·n⁴ + 5854·n³ + 7510·n² + 6559·n + 34. A270874