10662
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21336
- Proper Divisor Sum (Aliquot Sum)
- 10674
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3552
- Möbius Function
- -1
- Radical
- 10662
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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 distinct values taken by 3^3^...^3 (with n 3's and parentheses inserted in all possible ways).at n=12A003018
- Base 4 digits are, in order, the first n terms of the periodic sequence with initial period 2,2,1.at n=6A037561
- Number of primes between (prime(n + 1))^Pi and (prime(n))^Pi.at n=17A137380
- Numbers n such that prime[(n + 1)^2] - prime[n^2] is a perfect square.at n=20A145290
- Number of subsets of {1,2,...,n} whose sum is semiprime (cf. A001358, A064911).at n=14A181522
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^2<=x^2+y^2.at n=26A211806
- Number of n X 3 arrays with each row a permutation of 1..3 having at least as many downsteps as the preceding row, with rows in lexicographically nonincreasing order.at n=37A222001
- a(n) = Sum_{k=0..n} k^p*q^k, where p=3, q=-2.at n=6A232602
- Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and column sum unequal to 4 or 5 and every diagonal and antidiagonal sum equal to 4 or 5.at n=5A251900
- Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum unequal to 4 or 5 and every diagonal and antidiagonal sum equal to 4 or 5.at n=2A251903
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum unequal to 4 or 5 and every diagonal and antidiagonal sum equal to 4 or 5.at n=30A251905
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum unequal to 4 or 5 and every diagonal and antidiagonal sum equal to 4 or 5.at n=33A251905
- Coefficients of g.f. for the class of multiply-rooted C-trees.at n=7A280768
- Expansion of (1 + 8*x - 6*x^2 + 12*x^3 - 18*x^4)/(1 - x - 9*x^4 + 9*x^5).at n=15A309791
- Numbers k for which there are only 3 bases b (2, k+1 and another one) in which the digits of k contain the digit b-1.at n=21A337143
- a(n) = Sum_{d|n} d^(tau(d) - 1).at n=21A348349
- E.g.f. satisfies: A(x)^2 * log(A(x)) = 1 - exp(-x).at n=5A349656
- Inverse Moebius transform of tribonacci numbers (A000073).at n=17A357238
- G.f. A(x) satisfies A(x) = 1 + x*(1+x^2)^2*A(x)^3.at n=7A385065
- a(0) = 1; thereafter a(n) = 4*n^2 - 3*n + 2.at n=52A386486