12526
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18792
- Proper Divisor Sum (Aliquot Sum)
- 6266
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6262
- Möbius Function
- 1
- Radical
- 12526
- Omega Function (Ω)
- 2
- 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
- 112
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of n with equal nonzero number of parts congruent to each of 1, 3 and 4 (mod 5).at n=60A035590
- Positions of 4-digit terms in the continued fraction for Pi (3 is at position 0).at n=12A048959
- Partial sums of A139250.at n=40A160424
- G.f. satisfies: A(x) = 1/(1 - x/A(-x*A(x)^8)^3).at n=6A213231
- Least positive integer m such that m + n divides pi(m)^2 + pi(n)^2, where pi(x) denotes the number of primes not exceeding x.at n=30A248044
- G.f.: x = Sum_{n>=1} a(n) * [ Sum_{k>=1} k^n * x^k ]^n.at n=4A276744
- G.f.: Product_{k>=1} 1/(1+prime(k)*x^prime(k)).at n=26A298160
- Apply Lenormand's transformation k -> A318921(k) to the Fibonacci numbers.at n=37A318922
- a(n) is the number of triangular partitions whose Young diagram fits inside a square of side n.at n=25A368638