Properties of the Number 25661

Twenty-Five Thousand Six Hundred Sixty-One

Basics

Value: 25660 → 25661 → 25662

Parity: odd

Prime: No

Previous Prime: 25657

Next Prime: 25667

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 67 × 383

Divisors: 1, 67, 383, 25661

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010000111101

Octal: 62075

Duodecimal: 12A25

Hexadecimal: 643d

Square: 658486921

Square Root: 160.19051157918187

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

Positive integers of the form (30·m²+1)/11. A179339

Number of permutations of length n sortable by a pop stack followed by a queue and then by a stack. A214611

a(n) is the least number whose product of digits in primorial base equals n. A355036

Least k such that first k terms of A022303 contain n more 2's than 1's. A25518

Number of nX(n+1) arrays of permutations of n+1 copies of 0..n-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0. A267340

Number of 7Xn arrays containing n copies of 0..7-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo 7 and the upper left element equal to 0. A267347

Square array A(m,n) (m>=1, n>=1) read by antidiagonals: A(m,n) = (2·n - 1)^^m mod (2·n)^m (see Comments for definition of ^^). A324017

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0. A267338

Exponent of 6 (value of i) in n-th number of form 6ⁱ*8^j. A25661

Sequence U_n found on page 154 of Poulet (1934). A262566