16764
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 43008
- Proper Divisor Sum (Aliquot Sum)
- 26244
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 0
- Radical
- 8382
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 110
- 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) = (7*n+1)*(7*n+6).at n=18A001526
- Numbers whose base-7 representation contains exactly four 6's.at n=18A043420
- a(n) is the product of Catalan(n) and (2^(n+1) - 1).at n=6A063016
- Numbers k such that phi(k) + phi(k+1) divides sigma(k) + sigma(k+1).at n=22A067282
- a(n) = (5*n+2)*(5*n+7).at n=25A085036
- Numbers whose set of base 7 digits is {0,6}.at n=29A097253
- Number of (1,0)-steps at level zero in all Grand Motzkin paths of length n.at n=12A109190
- a(n) = prime(n)*(prime(n+1) + 1).at n=30A123134
- Values x for records of the minima of the positive distance d between the ninth power of a positive integer x and the square of an integer y such that d = x^9 - y^2 (x <> k^2 and y <> k^9).at n=25A179791
- Numbers k such that sopfr(k + omega(k)) = sopfr(k), where sopfr(i) = A001414(i) and omega(i) = A001221(i).at n=18A187878
- T(n,k) = 1/k! * Sum_{i=0..k} (-1)^(k-i) *C(k,i) * A258309(n,i); triangle T(n,k), n>=0, 0<=k<=floor(n/2), read by rows.at n=34A258310
- a(n) = Catalan(n-1)*Motzkin(n).at n=6A290442
- Number of integer compositions of n with all equal run-sums.at n=48A353851
- Number of minimum sized maximal subsets of {1..n} such that every pair of distinct elements has a different difference.at n=51A382396