10668
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 28672
- Proper Divisor Sum (Aliquot Sum)
- 18004
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3024
- Möbius Function
- 0
- Radical
- 5334
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 47
- 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
- Maximal kissing number of n-dimensional laminated lattice.at n=19A002336
- Greatest k such that binomial(k,n) has fewer than n distinct prime factors.at n=42A005735
- Weight distribution of [ 128,29,32 ] 2nd-order Reed-Muller code.at n=4A006006
- Weight distribution of [ 128,29,32 ] 2nd-order Reed-Muller code.at n=12A006006
- Theta series of laminated lattice LAMBDA_19.at n=2A023941
- Shifts left under "CGJ" (necklace, element, labeled) transform.at n=8A032151
- Four times second pentagonal numbers: a(n) = 2*n*(3*n+1).at n=42A033580
- Number of distinct ways to cut an n X n square into squares with integer sides.at n=6A045846
- Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j^3+k^3, ordered by increasing i; sequence gives j values.at n=12A054206
- Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n.at n=11A063048
- Let f(x) = phi(x) + sigma(x); a(n) = least k such that at k begins a maximal run of length n of consecutive strict local extrema of f, or 0 if no such k exists.at n=24A066923
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k.at n=12A088753
- Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximal number of contiguous border edges starting from the root in both directions is equal to k.at n=38A102595
- Record gaps between twin primes.at n=46A113274
- Terms of A068563 that are not terms of A124240.at n=42A124241
- Triangle read by rows: T(n,k) = (2^k-1)*binomial(n-1,k-1) (1<=k<=n).at n=51A124929
- Numbers k such that 5^k mod k = 5^k mod k^2.at n=28A125775
- Numbers k such that k^2 divides 5^k-1.at n=23A127105
- Weight distribution of [128,36,32] extended binary primitive BCH (or XBCH) code.at n=24A151411
- Weight distribution of [128,36,32] extended binary primitive BCH (or XBCH) code.at n=8A151411