Properties of the Number 25823

Twenty-Five Thousand Eight Hundred Twenty-Three

Basics

Value: 25822 → 25823 → 25824

Parity: odd

Prime: No

Previous Prime: 25819

Next Prime: 25841

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 ² × 17 × 31

Divisors: 1, 7, 17, 31, 49, 119, 217, 527, 833, 1519

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010011011111

Octal: 62337

Duodecimal: 12B3B

Hexadecimal: 64df

Square: 666827329

Square Root: 160.69536396548594

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

G.f. A(x) satisfies: [xⁿ] A(x)ⁿ⁺¹ = [xⁿ] (1 + x·A(x)ⁿ)ⁿ⁺¹ for n>=0. A302702

Number of distinct products i·j*k·l for 1 <= i <= j <= k <= l <= n. A100437

Nonnegative values·of solutions (x, y) to the Diophantine equation x²+(x+217)² = y². A198294

Number of partitions p of n such that (maximal multiplicity of the parts of p) <= (maximal part of p). A240311

a(n) = ∑_i=0..n digsum₈(i)³, where digsum₈(i) = A053829(i). A231682

Number of integer partitions of n whose Heinz number (product of primes of parts) is divisible by all parts. A330952

Number of distinct characteristic polynomials for 2 X 2 matrices with entries from {0, 1, ..., n}. A366448

Smallest composite which when sum of prime factors is repeatedly subtracted reaches a prime after n iterations. A53093

Numbers n for which φ(n)=σ(n'), where φ is the Euler totient function, σ is the sum of divisors and n' the arithmetic derivative of n. A189057

Number of strict partitions of 2n having an ordering of the parts in which no two neighboring parts have the same parity. A239882