14521
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15652
- Proper Divisor Sum (Aliquot Sum)
- 1131
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13392
- Möbius Function
- 1
- Radical
- 14521
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 71
- 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
- no
- Odd
- yes
Appears in sequences
- Cyclotomic polynomials at x=11.at n=12A019329
- Pseudoprimes to base 11.at n=32A020139
- Strong pseudoprimes to base 11.at n=7A020237
- Cyclotomic polynomials at x=-11.at n=12A020510
- dot_product(n,n-1,...2,1)*(7,8,...,n,1,2,3,4,5,6).at n=32A026066
- Expansion of (1-x^3)/(1-2x-x^3+x^4).at n=13A052903
- a(n) = n^4 - n^2 + 1.at n=11A060886
- a(n) = (n!)^2 + n! + 1.at n=5A066142
- Partial sums of usigma(n)^2: square of the sum of unitary divisors of n.at n=27A074789
- a(n) = 9*n^2 + 3*n + 1.at n=40A082040
- a(n) = 16*n^2 + 4*n + 1.at n=30A082041
- a(n) = sigma_4(n^2)/sigma_2(n^2).at n=10A084218
- Number of (k+1)-tuples of integers modulo n (x_1,...,x_k,s) such that at least one subset of the x_i sums to s mod n. In other words, n^k times the expected number of distinct subset sums mod n of k integers mod n chosen uniformly at random. Read by antidiagonals, i.e., with entries in the order (n,k)=(1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...at n=51A098966
- a(n) = 484*n + 1.at n=29A158326
- a(n) = 30*n^2 + 1.at n=22A158558
- Reversed decimal expansions of A178510.at n=2A178512
- Numbers n such that the greatest prime divisor p of n^2+1 has the property that (p - n)^2 + 1 = p.at n=42A206246
- Number of 2 X 2 matrices having all terms in {1,...,n} and nonnegative determinant.at n=12A211058
- Number of (w,x,y,z) with all terms in {0,...,n} and 2w-x=max{w,x,y,z}-min{w,x,y,z}.at n=30A212756
- Expansion of q^(-1/3) * a(q)^2 * c(q) / 3 in powers of q where a(), c() are cubic AGM theta functions.at n=40A231947