Properties of the Number 25069

Twenty-Five Thousand Sixty-Nine

Basics

Value: 25068 → 25069 → 25070

Parity: odd

Prime: No

Previous Prime: 25057

Next Prime: 25073

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 43 × 53

Divisors: 1, 11, 43, 53, 473, 583, 2279, 25069

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110000111101101

Octal: 60755

Duodecimal: 12611

Hexadecimal: 61ed

Square: 628454761

Square Root: 158.33192981834083

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..n+k-2 arrays with upper left zero and lower right n+k-2 and each element differing from its horizontal and vertical neighbors by one or two. A265447

Expansion of ∏_k>=0 1/(1 + x^3·k+2)^3·k+2. A285310

a(n) is the smallest number such that there are exactly n numbers k (including a(n) itself) such that U(k) is isomorphic to U(a(n)) (or 0 if no such number exists). Here U(k) is the multiplicative group of integers modulo k. A303712

Number of arrays of -1..1 integers x(1..n) with every x(i) in a subsequence of length 1, 2, 3 or 4 with sum zero. A193703

Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 2 or more, starting with 0. A221516

Number of nX3 0..n+3-2 arrays with upper left zero and lower right n+3-2 and each element differing from its horizontal and vertical neighbors by one or two. A265442

Number of nX5 0..n+5-2 arrays with upper left zero and lower right n+5-2 and each element differing from its horizontal and vertical neighbors by one or two. A265444

Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 5). A35566

a(0) = 1; for n>0, a(n) = 2ⁿ + 1. A83318

Number of nX7 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically. A207268