Properties of the Number 25874

Twenty-Five Thousand Eight Hundred Seventy-Four

Basics

Value: 25873 → 25874 → 25875

Parity: even

Prime: No

Previous Prime: 25873

Next Prime: 25889

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 17 × 761

Divisors: 1, 2, 17, 34, 761, 1522, 12937, 25874

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010100010010

Octal: 62422

Duodecimal: 12B82

Hexadecimal: 6512

Square: 669463876

Square Root: 160.85397104206038

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 upward triangles in a Star of David matchstick arrangement of size n. A45950

Number of sets of exactly five nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. A293967

Number of length n+6 0..1 arrays with every seven consecutive terms having the maximum of some three terms equal to the minimum of the remaining four terms. A250366

Expansion of 1/((1-x⁴)*(1-x⁹)*(1-x¹²)). A25874

a(n) = number of n-digit terms in A023086. A159827

A product triangle sequence based on:a=2;f(n, a) = f(n - 1, a) + a·f(n - 2, a); c(n,a)=If[n == 0, 1, Product[f(i, a)*f(i + 1, a), {i, 1, n}]]; t(n,m,a)=If[Floor[n/2] >= m, c(n, a)/c(n - m, a), c(n, a)/c(m, a)]. A174410

Minimum size of a partial order that contains all partial orders of size n. A340318