ℕ atory
Play Now

Properties of the Number 25268

Twenty-Five Thousand Two Hundred Sixty-Eight

Basics

Value: 25267 → 25268 → 25269

Parity: even

Prime: No

Previous Prime: 25261

Next Prime: 25301

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 2 × 6317

Divisors: 1, 2, 4, 6317, 12634, 25268

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001010110100

Octal: 61264

Duodecimal: 12758

Hexadecimal: 62b4

Square: 638471824

Square Root: 158.95911424010893

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

T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-1,-2) (-2,-1) or (-1,0) and new values introduced in order 0..2. A274728
Maximum starting value of X such that repeated replacement of X with X-ceiling(X/5) requires n steps to reach 0. A279075
Total number of sides of a tetraflake-like fractal after n iterations, a(1) = 16 (see comments). A235643
a(1)=1. a(n) = a(n-1) + (largest integer occurring among {a(1),a(2),a(3),...,a(n-1)} that is coprime to n). A120939
Partition the j digits of n into blocks of k, with 1 <= k <= j-1, starting at right and multiply. Sum of these numbers equals n. A275170
"DFK" (bracelet, size, unlabeled) transform of 1,3,5,7... A32217
Number of nX2 1..4 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order. A166777
Number of nX7 0..2 arrays with no element equal to any value at offset (-1,-2) (-2,-1) or (-1,0) and new values introduced in order 0..2. A274727
Number of nXnXn triangular binary arrays with all 1s connected, no 1 having more than 2 1s adjacent, and a path of 1s from peak vertex to anywhere on the bottom side. A163881
a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, with initial values 1,1,1,1. A25268