16380
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 72
- Divisor Sum
- 61152
- Proper Divisor Sum (Aliquot Sum)
- 44772
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- 0
- Radical
- 2730
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 5
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
- 159
- 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
- Number of ways of writing n as a sum of 6 squares.at n=32A000141
- Landau's function g(n): largest order of permutation of n elements. Equivalently, largest LCM of partitions of n.at n=39A000793
- Landau's function g(n): largest order of permutation of n elements. Equivalently, largest LCM of partitions of n.at n=38A000793
- Fermat coefficients.at n=11A000971
- sigma_3(n): sum of cubes of divisors of n.at n=23A001158
- Glaisher's function H'(4n+1) (18 squares version).at n=33A002610
- Increasing values of A000793 (largest order of permutation of n elements).at n=24A002809
- Number of nonequivalent dissections of a polygon into n pentagons by nonintersecting diagonals rooted at a cell up to rotation.at n=6A005037
- Theta series of D_6 lattice.at n=16A008428
- Number of irreducible alternating Euler sums of depth 6 and weight 6+2n.at n=22A011796
- a(n) = floor(binomial(n,5)/6).at n=28A011843
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/30).at n=28A011940
- a(n) = 2*a(n-1) if n odd else 2*a(n-1) + 6.at n=12A014131
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (4,k)-perfect numbers.at n=44A019293
- Theta series of A*_8 lattice.at n=40A023920
- Perimeters of more than one primitive Pythagorean triangle.at n=27A024408
- Triangle of the fourth power of the normalized, unsigned Stirling matrix of the first kind.at n=34A027479
- a(n) = n*(n^4-1)/2.at n=6A027484
- Molien series for full 8 X 8 Siegel modular group H_3 of order 371589120.at n=43A027633
- a(n) = (n+1)*binomial(n+4, 4).at n=11A027800