Properties of the Number 25182

Twenty-Five Thousand One Hundred Eighty-Two

Basics

Value: 25181 → 25182 → 25183

Parity: even

Prime: No

Previous Prime: 25171

Next Prime: 25183

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 1399

Divisors: 1, 2, 3, 6, 9, 18, 1399, 2798, 4197, 8394

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001001011110

Octal: 61136

Duodecimal: 126A6

Hexadecimal: 625e

Square: 634133124

Square Root: 158.6883738652583

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 Dyck paths of semilength n such that each positive level up to the highest nonempty level has exactly two peaks. A287845

Numbers k such that k³ contains a pandigital substring. A115933

Row sum of column n in A126441 or A161924. A171426

Numbers n for which number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n. A224303

Numbers n such that d(n-2) = d(n) = d(n+2) = 12 where d(n)=A000005(n). A190645

Number of permutations of [n] with at least one strong fixed point (a permutation p of {1,2,...,n} is said to have j as a strong fixed point if p(k) < j for k < j and p(k) > j for k > j). A6932

a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is an integer, s(0) = 0, |s(1)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2, s(n) = 4. Also a(n) = T(n,n-4), where T is the array defined in A025177. A25182