14520
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 47880
- Proper Divisor Sum (Aliquot Sum)
- 33360
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3520
- Möbius Function
- 0
- Radical
- 330
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 4
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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- a(n) = n*(n + 1)*(n^2 + n + 2)/4.at n=15A001621
- a(n) = n*(n+1)^2*(n+2)^2/12.at n=10A004282
- a(n) = (2*n+1)^2*n!.at n=5A007681
- Number of ordered quadruples of integers from [ 1,n ] with no common factors between pairs.at n=41A015636
- a(n) = floor(n/2) * floor((n-1)/2) * floor((n-2)/2) * floor((n-3)/2) * floor((n-4)/2) / 12.at n=25A028725
- Irreducible Euler sums of weight 8 and depth 10+2n.at n=13A031164
- Coordination sequence for A_15 lattice.at n=2A035841
- Expansion of 1/((1-x)*(1-x^2))^4.at n=14A038164
- Hexagonal matchstick numbers: a(n) = 3*n*(3*n+1).at n=40A045945
- Triangle inverse to that in A046899.at n=41A046900
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= n/2.at n=20A047164
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n-1)/2.at n=20A047175
- a(n) = n*(n-1)^2*(n-2).at n=10A047928
- Revert transform of x*(x - 1)^2/(1 - x + x^3).at n=9A049128
- T(2n+6,n), array T as in A051168; a count of Lyndon words.at n=8A050184
- Expansion of e.g.f. x/((1-x)*(1-3*x)).at n=5A052698
- Expansion of (1+6*x+x^2)/(1-x)^8.at n=7A059600
- Numbers k such that sigma(x) = k has exactly 9 solutions.at n=32A060665
- Number of permutations p from (1,2,3,...,n) to (1,2,3...,n) such that 1/p(1)+2/p(2)+...+n/p(n) is an integer.at n=13A073090
- Number of permutations p from (1,2,3,...,n) to (1,2,3...,n) such that 1/p(1)+2/p(2)+...+n/p(n) is an integer.at n=12A073090