11707
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12240
- Proper Divisor Sum (Aliquot Sum)
- 533
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11176
- Möbius Function
- 1
- Radical
- 11707
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 143
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- First appearance in the decimal expansion of Pi of the first n digits of the decimal expansion of e.at n=3A071918
- Number of squares on infinite half chessboard at <=n knight moves from a fixed point on the diagonal.at n=41A098499
- Terms in A112039 that are divisible by 3, divided by 3.at n=18A112040
- Triangle read by rows: T(n,k) is the number of ways of building a building of height k using n 2 X 4 LEGO blocks, counted up to symmetry (for 2 <= k <= n).at n=3A112390
- Partial sums of A151779.at n=43A151781
- n for which A079277(n) + phi(n) < n.at n=12A208815
- Number of partitions p of n such that (number of numbers in p of form 3k+1) > (number of numbers in p of form 3k+2).at n=38A241739
- a(n) = n*(11*n + 3)/2.at n=46A254963
- Numbers m such that m^2 is the sum of the squares of two or more consecutive primes.at n=4A270424
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n)^2, where a(0) = 3, a(1) = 4, b(0) = 1, b(1) = 2, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=12A296250
- Partial sums of A298033.at n=51A298034
- Expansion of Sum_{k>=1} (-1 + Product_{j>=1} 1/(1 - j*x^(k*j))).at n=14A318025
- Number of zeroless strictly pandigital numbers divisible by the n-th prime.at n=10A339498
- Sum of numbers of ways to choose a k-chain of divisors of n - k, for k = 0..n - 1.at n=28A343940
- First of 5 consecutive semiprimes congruent to 1,2,3,4,5 (mod 6).at n=7A367104