10825
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13454
- Proper Divisor Sum (Aliquot Sum)
- 2629
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- 0
- Radical
- 2165
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 61.at n=8A020400
- Number of inequivalent (ordered) solutions to n^2 = sum of 7 squares of integers >= 0.at n=46A065461
- a(n) = 4a(n-1) - 4a(n-2) + 3a(n-3) + a(n-4) - a(n-5).at n=9A092493
- Expansion of g.f.: x/((1-x^2)^5 - 1 + x).at n=6A123890
- a(n) = a(n-1) + 12*n for n > 1; a(1) = 1.at n=41A166873
- Number of (n+3) X 5 0..1 matrices with each 4 X 4 subblock idempotent.at n=14A224562
- T(n,k)=Number of second differences of arrays of length n+2 of numbers in 0..k.at n=47A228218
- Number of second differences of arrays of length 5 of numbers in 0..n.at n=7A228220
- 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.at n=9A261134
- Numbers n such that n, p=prime(n) and q=prime(p) have the same sum of digits.at n=19A261142
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 585", based on the 5-celled von Neumann neighborhood.at n=6A273074
- 38-gonal numbers: a(n) = n*(18*n-17).at n=25A282850
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 9.at n=53A284782
- Odd composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 7 (mod m), where U(m) and V(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=7 and b=-1, respectively.at n=21A337630
- Odd composite integers m such that A086902(m) == 7 (mod m).at n=30A338079
- 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.at n=43A339520
- Odd composite integers m such that A054413(m-J(m,53)) == 0 (mod m), where J(m,53) is the Jacobi symbol.at n=28A340096
- Numbers k for which the 3-adic valuations of k and sigma(k) are equal, and that also satisfy Euler's criterion for odd perfect numbers (see A228058).at n=42A349755
- Number of irreducible pairs of partitions of n.at n=58A376821
- Numbers k satisfying Euler's criterion for odd perfect numbers (A228058), such that sigma(k)+k is also a multiple of 3, and sigma(k) preserves the 3-adic valuation of k, where sigma is the sum of divisors function.at n=42A387162