11605
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15264
- Proper Divisor Sum (Aliquot Sum)
- 3659
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8400
- Möbius Function
- -1
- Radical
- 11605
- 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
- 24
- 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
- no
- Odd
- yes
Appears in sequences
- Number of unrooted achiral trees with n nodes.at n=34A003244
- Start of first run of n consecutive integers with same number of divisors.at n=4A006558
- Numbers k such that k, k+1, k+2 and k+3 have the same number of divisors.at n=9A006601
- Generalized Fibonacci numbers.at n=10A015441
- a(n) = (9^n-4^n)/5.at n=5A016153
- Number of squares on infinite chessboard at <= n knight's moves from a fixed square.at n=29A018836
- Erroneous version of A006558.at n=4A019272
- Sets of 4 consecutive numbers with equal number of divisors.at n=36A039665
- Numbers whose base-2 representation has exactly 13 runs.at n=12A043580
- Numbers k such that k through k+4 all have the same number of divisors.at n=0A049051
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=23A066509
- a(n) = floor((Sum_{i=1..n} 1/i)^n).at n=8A067052
- a(n) = 4*a(n-1) + 1, a(1)=11.at n=5A072262
- Average of terms in n-th row of A077529.at n=18A077532
- Numbers n such that C(4n,n)/(3n+1) (A002293) is not divisible by 4.at n=34A078971
- Expansion of (5 - 9*x + 6*x^2)/(1-x)^4.at n=32A080957
- Number of 4k+3 integers in range [2^n, 2^(n+1)] whose Jacobi-vector is not a valid Motzkin-path (A095101).at n=15A095091
- Array read by antidiagonals: T(n, k) = ((n+4)^k-(n-1)^k)/5.at n=60A102765
- Triangle of sums of Jacobsthal numbers related to binomial(4n,n)/(3n+1) mod 4.at n=26A113049
- Rectangular array read by antidiagonals: a(n, d) is the smallest number that starts an arithmetic progression with common difference d of n numbers with the same number of divisors.at n=10A113465