Properties of the Number 82425

Eighty-Two Thousand Four Hundred Twenty-Five

Basics

Value: 82424 → 82425 → 82426

Parity: odd

Prime: No

Previous Prime: 82421

Next Prime: 82457

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 ² × 7 × 157

Divisors: 1, 3, 5, 7, 15, 21, 25, 35, 75, 105

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100000111111001

Octal: 240771

Duodecimal: 3B849

Hexadecimal: 141f9

Square: 6793880625

Square Root: 287.0975443991118

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(n) = T(2·n-1, n-2), where T is given by A026584. A26594

Numbers k for which φ(A267099(k)) is equal to φ(k), but the number of 4m+1 and 4m+3 primes in the prime factorization of k (when counted with multiplicity) is not equal. Here A267099 is fully multiplicative involution swapping the positions of 4m+1 and 4m+3 primes, and φ is Euler totient function. A354194

T(2n-1,n-2), T given by A026568. A26578

a(1)=1, a(n) = -1 + n*∑_j=1..n-1 a(j). A82425

Triangle T(n,d) read by rows: Number of ascent sequences of length n with d zeros. A175579

T₇(n) in the notation of Bergeron et al., u_k(n) in the notation of Gessel: Related to Young tableaux of bounded height. A72131

Number of permutations in S_n containing an increasing subsequence of length 8. A217675