16560
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
- 60
- Divisor Sum
- 58032
- Proper Divisor Sum (Aliquot Sum)
- 41472
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 0
- Radical
- 690
- Omega Function (Ω)
- 8
- 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
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 128
- 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
- For all n, if d is recursively applied to a(n) exactly 6 times then the fixed point of d-iteration is just reached.at n=20A036458
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049747.at n=46A049750
- Factorial splitting: write n! = x*y*z with x<y<z and x maximal and z is minimal; sequence gives value of z-x.at n=18A061033
- Least number with exactly n prime factors counted with multiplicity which gives a different number with exactly n prime factors counted with multiplicity when digits are reversed.at n=7A109018
- Numbers that have exactly eight prime factors counted with multiplicity (A046310) whose digit reversal is different and also has 8 prime factors (with multiplicity).at n=0A109028
- Least sum (n+1) + (n+2) + ... + (n+k) that is a multiple of the n-th triangular number, n(n+1)/2.at n=22A110351
- Binet's factorial series. Denominators of the coefficients of a convergent series for the logarithm of the Gamma function.at n=21A122253
- a(n) = n^3 + 114 * n.at n=23A122562
- Smallest k such that phi(x) = k has exactly n odd solutions.at n=31A130669
- Product of the nonzero exponents in the prime factorization of n!.at n=26A135291
- Triangular sequence defined by T(n, m) = (r^(n-m)*q^m + r^m*q^(n-m))*b(n), where b(n) = coefficients of p(x, n) = 2^n*(1-x)^(n+1) * LerchPhi(x, -n, 1/2), and r=2, q=3.at n=12A154696
- 10^n+9^n-1.at n=4A155669
- Symmetric array T(n,m) of the number of 2-convex polygons with 2n horizontal and 2m vertical steps, read by antidiagonals.at n=8A157518
- Symmetric array T(n,m) of the number of 2-convex polygons with 2n horizontal and 2m vertical steps, read by antidiagonals.at n=7A157518
- Numbers with prime factorization pqr^2s^4.at n=12A190107
- One more than positions of records in A249442.at n=9A249149
- Number of (n+2)X(3+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=5A256743
- Number of (n+2)X(6+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=2A256746
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=33A256748
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 3 and no antidiagonal sum 3 and no row sum 0 and no column sum 0.at n=30A256748