Properties of the Number 25683

Twenty-Five Thousand Six Hundred Eighty-Three

Basics

Value: 25682 → 25683 → 25684

Parity: odd

Prime: No

Previous Prime: 25679

Next Prime: 25693

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 1223

Divisors: 1, 3, 7, 21, 1223, 3669, 8561, 25683

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110010001010011

Octal: 62123

Duodecimal: 12A43

Hexadecimal: 6453

Square: 659616489

Square Root: 160.25916510452686

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

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 406", based on the 5-celled von Neumann neighborhood. A281893

Column 3 of triangle A128545; a(n) is the coefficient of q³ⁿ⁺⁹ in the central q-binomial coefficient [2n+6,n+3]. A128553

a(n) = n + max_{0 <= i <n} ((n-i)*a(i)), a(0) = 1. A8609

4th elementary symmetric function of {1, p(1), p(2), ..., p(n-1)}, where p(0) = 1. A24524

Number of partitions satisfying (cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5) and cn(4,5) <= cn(2,5) and cn(4,5) <= cn(3,5)). A36803

a(1) = 1 ; for n > 1, a(n) is the smallest number such that a(n)² + 1 contains n distinct prime divisors dividing a(n+1)² + 1. A193164

Exponent of 9 (value of i) in n-th number of form 9ⁱ*10^j. A25683

a(n) is the smallest k > 1 such that the sum of digits of n^k is a power of n (or -1 if no such k exists). A358633