Properties of the Number 25813

Twenty-Five Thousand Eight Hundred Thirteen

Basics

Value: 25812 → 25813 → 25814

Parity: odd

Prime: No

Previous Prime: 25801

Next Prime: 25819

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 83 × 311

Divisors: 1, 83, 311, 25813

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010011010101

Octal: 62325

Duodecimal: 12B31

Hexadecimal: 64d5

Square: 666310969

Square Root: 160.6642461781712

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

a(n) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly n ways, or 0 if no such number exists. A350241

Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of semilength n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having k UUU's (U=(1,1)). A191518

Number of dispersed Dyck paths of semilength n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having no UUU's (U=(1,1)). A191519

Number of Gram blocks [g(j), g(j+5)) up to 10ⁿ with 0 <= j < 10ⁿ. A231161

Number of partitions of n with up to nine distinct kinds of 1. A320696

Numbers k such that the abundancy index of σ(k) divided by the abundancy index of d(k) equals a whole number. A392507

Coefficients of a solution to a functional equation. A92834

Expansion of 1/((1-x²)*(1-x⁶)*(1-x⁷)). A25813