ℕ atory
Play Now

Properties of the Number 10525

Ten Thousand Five Hundred Twenty-Five

Basics

Value: 10524 → 10525 → 10526

Parity: odd

Prime: No

Previous Prime: 10513

Next Prime: 10529

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 2 × 421

Divisors: 1, 5, 25, 421, 2105, 10525

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10100100011101

Octal: 24435

Duodecimal: 6111

Hexadecimal: 291d

Square: 110775625

Square Root: 102.59142264341595

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

Number of partitions of n such that there is exactly one part which occurs twice, while all other parts occur only once. A90858
Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits. A20342
Sum of largest parts (counted with multiplicity) of all partitions of n into odd parts. A92310
Numbers k congruent to 1 or 5 mod 6, for which A064989(A064989(σ(k))) > A064989(A064989(k)), where A064989 shifts the prime factorization one step towards lower primes, and σ is the sum of divisors function. A348754
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
Numbers k such that continued fraction of (1 + sqrt(k))/2 has period 11. A146335
a(n) is the minimal odd odious k > 1, such that ki, i=1,2,...,n, all are odious, or a(n)=0, if there is no such k. A230496
a(n) = 18·a(n-1) - 79·a(n-2) for n > 1; a(0) = 1, a(1) = 10. A163461
G.f. B(x) satisfies: B(x) = 1 + x·A(x)*C(x) where A(x) = B(x)*C(x) and C(x) = 1 + 2·x*A(x)*B(x). A258314
Triangle read by rows: T(n,k) = 4·T(n-1,k-1) + T(n,k-1) with T(2·m,0) = 0 and T(2·m+1,0) = 5m. A292466