11528
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23760
- Proper Divisor Sum (Aliquot Sum)
- 12232
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5200
- Möbius Function
- 0
- Radical
- 2882
- Omega Function (Ω)
- 5
- 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
- 143
- 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
- yes
- Odd
- no
Appears in sequences
- Four times pentagonal numbers: a(n) = 2*n*(3*n-1).at n=44A033579
- a(n) = 5^n-4^n-1.at n=5A054401
- (Sum of digits of n)^6 - (sum of digits^6 of n).at n=14A069966
- (Sum of digits of n)^6 - (sum of digits^6 of n).at n=41A069966
- Triangle T(n,k) (n >= 2, 1 <= k <= n-1) giving number of non-crossing trees with n nodes and height k.at n=32A072248
- Convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n >= 0, with itself.at n=11A073371
- Inverse binomial transform of A003418.at n=9A100443
- First of two consecutive numbers with at least one 3 in their prime signature.at n=58A176313
- Number of 3-step self-avoiding walks on an n X n square summed over all starting positions.at n=31A188148
- Number of solutions to x^2 + y^2 + z^2 + t^2 == n (mod 2*n) for x,y,z,t in [0, 2*n).at n=10A229294
- Number of non-congruent solutions of x^2 + y^2 + z^2 + t^2 == 0 mod n.at n=21A240547
- Number of compositions of n into parts 3, 5 and 9.at n=50A245370
- Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=49A249139
- Number of length n+7 0..1 arrays with at most one downstep in every 7 consecutive neighbor pairs.at n=11A255991
- Numbers k such that k and k+1 both have 16 divisors.at n=27A274359
- a(n) = (1/2) * Sum_{|k|<=2*sqrt(p)} k^6*H(4*p-k^2) where H() is the Hurwitz class number and p is the n-th prime.at n=3A297492
- Number of non-congruent solutions of x^2+y^2 == z^2+w^2 (mod n).at n=21A316148
- (1/4) * number of ways to select 3 distinct points forming a triangle of unsigned area = n/2 from a square of grid points with side length n.at n=14A320310
- Number of collinear triples in a 4 X n rectangular grid.at n=25A334706
- Number of ways to select 3 or more collinear points from an n X n grid.at n=8A355553