11709
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
- 6
- Divisor Sum
- 16926
- Proper Divisor Sum (Aliquot Sum)
- 5217
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7800
- Möbius Function
- 0
- Radical
- 3903
- Omega Function (Ω)
- 3
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 174
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of Product_{m>=1} (1+x^m)^9.at n=7A022574
- Numbers k such that 2*5^k + 1 is prime.at n=11A058934
- Numbers n such that n and n+2 are of the form p^2*q where p and q are distinct primes.at n=38A074173
- Interprimes which are of the form s*prime, s=9.at n=37A075284
- Inrepfigit (INverse REPetitive FIbonacci-like diGIT) numbers (or Htiek numbers).at n=11A128546
- Number of days after Jan 01 1000 such that the date written in the format DDMMYYYY is palindromic.at n=12A210885
- Partitions with superdiagonal growth: number of partitions (p0, p1, p2, ...) of n with pi - p0 >= i.at n=51A238860
- Number of partitions p of n such that mean(p) > multiplicity(max(p)).at n=34A240202
- Number of (n+1) X (1+1) 0..2 arrays with every 2 X 2 subblock summing to 3 4 or 5.at n=3A251344
- Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock summing to 3 4 or 5.at n=0A251347
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 3 4 or 5.at n=6A251351
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 3 4 or 5.at n=9A251351
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 555", based on the 5-celled von Neumann neighborhood.at n=6A272921
- Consider the digit reverse of a number x. Take the sum of these digits and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to x.at n=21A289868
- Partial sums of A304077.at n=44A304079
- Numbers k of the form k = ab (the decimal concatenation of a and b) such that phi(ab) = a*b + 1.at n=4A336191
- a(n) is the least k such that A076620(k) = n.at n=9A341803
- Number of partitions of the (n+4)-multiset {0,...,0,1,2,3,4} with n 0's into distinct multisets.at n=12A346824
- Odd numbers for which sigma(k) is congruent to 2 modulo 4 and the 3-adic valuation of k is one larger than the 3-adic valuation of sigma(k).at n=42A351534
- Numbers k such that k and k+2 both have exactly 6 divisors.at n=40A356743