Properties of the Number 25761

Twenty-Five Thousand Seven Hundred Sixty-One

Basics

Value: 25760 → 25761 → 25762

Parity: odd

Prime: No

Previous Prime: 25759

Next Prime: 25763

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 31 × 277

Divisors: 1, 3, 31, 93, 277, 831, 8587, 25761

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010010100001

Octal: 62241

Duodecimal: 12AA9

Hexadecimal: 64a1

Square: 663629121

Square Root: 160.50233643159217

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

Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers. A1567

Euler pseudoprimes: composite numbers n such that 2^(n-1/2) == +-1 (mod n). A6970

Euler-Jacobi pseudoprimes: 2^(n-1/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol. A47713

Composite numbers k such that k == +-1 (mod 8) and 2^(k-1/2) == 1 (mod k). A6971

Pseudoprimes k to base 2 such that k-2 and k+2 are primes. A57942

Sarrus numbers A001567 that are not Carmichael numbers A002997. A153508

G.f.: A(x) = exp( ∑_n>=1 3·A038500(n) * xⁿ/n ), where A038500 is the highest power of 3 dividing n. A161809

E.g.f. A(x) satisfies: [xⁿ] A(x)^2·n = (n+1) * [x^n-1] A(x)^2·n for n>=1. A300735

Number of Motzkin paths of length n having no consecutive (1,0) steps. A104545

Composite numbers k == 1 (mod 4) such that (1 + i)^k == 1 + i (mod k), where i = sqrt(-1). A270698