ℕ atory
Play Now

Properties of the Number 10825

Ten Thousand Eight Hundred Twenty-Five

Basics

Value: 10824 → 10825 → 10826

Parity: odd

Prime: No

Previous Prime: 10799

Next Prime: 10831

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 2 × 433

Divisors: 1, 5, 25, 433, 2165, 10825

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10101001001001

Octal: 25111

Duodecimal: 6321

Hexadecimal: 2a49

Square: 117180625

Square Root: 104.04326023342406

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

Standard composition numbers of compositions whose maximal runs all belong to {(1), (2,2), (3,3,3), ...}. A389530
T(n,k)=Number of second differences of arrays of length n+2 of numbers in 0..k. A228218
Odd composite integers m such that A054413(m-J(m,53)) == 0 (mod m), where J(m,53) is the Jacobi symbol. A340096
Number of partitions of subsets s of {1,...,n}, where all integers belonging to a run of consecutive members of s are required to be in different parts. A261134
Numbers k for which the 3-adic valuations of k and σ(k) are equal, and that also satisfy Euler's criterion for odd perfect numbers (see A228058). A349755
Odd composite integers m such that A086902(2·m-J(m,53)) == 7·J(m,53) (mod m), where J(m,53) is the Jacobi symbol. A339520
Number of inequivalent (ordered) solutions to n2 = sum of 7 squares of integers >= 0. A65461
Numbers k satisfying Euler's criterion for odd perfect numbers (A228058), such that σ(k)+k is also a multiple of 3, and σ(k) preserves the 3-adic valuation of k, where σ is the sum of divisors function. A387162
a(n) = a(n-1) + 12·n for n > 1; a(1) = 1. A166873
The number of partitions of n which represent Chomp positions with Sprague-Grundy value 9. A284782