Properties of the Number 25968

Twenty-Five Thousand Nine Hundred Sixty-Eight

Basics

Value: 25967 → 25968 → 25969

Parity: even

Prime: No

Previous Prime: 25951

Next Prime: 25969

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ⁴ × 3 × 541

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010101110000

Octal: 62560

Duodecimal: 13040

Hexadecimal: 6570

Square: 674337024

Square Root: 161.1458966278695

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 regions formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the square. A355798

T(n,k) = Number of (n+1) X (k+1) arrays of permutations of 0..(n+1)*(k+1)-1 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order. A263519

Number of (w,x,y,z) with all terms in {1,...,n} and median=mean. A212133

Numbers n such that 1 + Sum{k=1..n/2} A001223(2k-1)*(-1)^k = 0. A130642

Numbers k such that 24·k-1 has at least three factors 7 and the partition function evaluated at k has at least the same number of factors 7 as 24·k-1. A340957

Triangle read by rows, A095989 convolved with A000670. A163204

Minimum sum of n distinct positive numbers, any n-1 of which sum to a square. A35305

Numbers n such that 1 + S(n) = 0, where S(n) = (S(n-1) + A000040(n))*(-1)ⁿ; S(0)=0, n=>1. A131196

Number of length 3 0..n arrays with each partial sum starting from the beginning no more than one standard deviation from its mean. A244791

Number of (n+1)X(3+1) arrays of permutations of 0..n·4+3 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order. A263514