12529
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14688
- Proper Divisor Sum (Aliquot Sum)
- 2159
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10560
- Möbius Function
- -1
- Radical
- 12529
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 125
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- no
- Odd
- yes
Appears in sequences
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=33A000330
- Odd square pyramidal numbers.at n=16A015221
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).at n=32A024598
- (1/18)*Difference between concatenation of n and n^2 and concatenation of n^2 and n.at n=33A055435
- Consider the line segment in R^n from the origin to the point P=(1,2,3,...,n); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times P.P.at n=32A059774
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=28A070192
- a(n) = (1/24)*(sigma_3(2*n-1) - sigma_1(2*n-1)).at n=33A081861
- Least area/6 of primitive Pythagorean triangles with odd leg 2n+1.at n=32A096893
- Structured rhombic dodecahedral numbers (vertex structure 9).at n=16A100157
- Sequence and first differences include all square numbers exactly once.at n=32A109678
- a(0)=0; then a(4*k+1)=a(4*k)+(4*k+1)^2, a(4*k+2)=a(4*k+1)+(4*k+3)^2, a(4*k+3)=a(4*k+2)+(4*k+2)^2, a(4*k+4)=a(4*k+3)+(4*k+4)^2.at n=33A115391
- 1/24 of product of three numbers: n-th prime, previous and following number.at n=17A127922
- Binomial transform of A012245 (characteristic function of factorial numbers).at n=17A143963
- Directed genus of the binary de Bruijn graph D_n.at n=15A151998
- Partial sums of [A080782^2].at n=32A164765
- Values k: A165495(k) is odd.at n=43A165496
- Number of nX3 binary arrays without the pattern 1 1 0 diagonally, vertically, antidiagonally or horizontally.at n=5A188601
- T(n,k)=Number of nXk binary arrays without the pattern 1 1 0 diagonally, vertically, antidiagonally or horizontally.at n=33A188607
- Number of 6Xn binary arrays without the pattern 1 1 0 diagonally, vertically, antidiagonally or horizontally.at n=2A188611
- The number of binary pattern classes in the (2,n)-rectangular grid with 3 '1's and (2n-3) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=34A225972