11645
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14904
- Proper Divisor Sum (Aliquot Sum)
- 3259
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8704
- Möbius Function
- -1
- Radical
- 11645
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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
- Fibonacci sequence beginning 5, 16.at n=15A022140
- a(n) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4).at n=29A026043
- Moebius transform of binomial(n+3, 4).at n=21A117109
- Odd interprimes divisible by 17.at n=39A124620
- a(n) = 1 + n + binomial(n+3,5).at n=16A154322
- Numbers k such that k, k + 1 and k + 2 are 3 consecutive Harshad numbers.at n=29A154701
- Number of binary strings of length n with no substrings equal to 000, 010, or 111.at n=42A164317
- a(n) = n*(n-3)*(n^2-7*n+14)/8.at n=17A176145
- Number of partitions p of n such that (maximal multiplicity of the parts of p) < (maximal part of p).at n=35A240310
- Numbers n that are the product of three distinct odd primes and x^2 + y^2 = n has integer solutions.at n=39A264498
- a(n) = (A269590(n)^2 + 4)/5^n, n >= 0.at n=6A269594
- Number of n X 3 0..2 arrays with no element equal to any value at offset (0,-1) (-1,-1) or (-2,0) and new values introduced in order 0..2.at n=10A274890
- G.f.: 1 + Sum_{n>=1} a(n)*x^n/(1 - x^n) = Product_{n>=1} 1/(1 - n*x^n).at n=14A300277
- a(n) is the number of edges formed by n-secting the angles of a pentagon.at n=30A335555
- a(n) = floor(8*n^3/27).at n=34A379852