11669
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13344
- Proper Divisor Sum (Aliquot Sum)
- 1675
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9996
- Möbius Function
- 1
- Radical
- 11669
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 7 (most significant digit on left).at n=48A029452
- Number of unordered pairs of partitions of n (into distinct parts) with empty intersection.at n=30A108796
- Composite numbers, not ending with 0, sharing a 3-digit sequence with some of its prime factors.at n=8A131523
- Numbers k such that k and k^2 use only the digits 1, 3, 5, 6 and 9.at n=20A137035
- Number of 0..n arrays x(0..4) of 5 elements with nondecreasing average value.at n=9A200765
- a(n) = (a(n-1)^2*a(n-3)^4+a(n-2))/a(n-4) with a(0)=a(1)=a(2)=a(3)=1.at n=7A208227
- Number of partitions p of n such that m(p) <= m(c(p)), where m = minimal multiplicity of parts, and c = conjugate.at n=33A240730
- Expansion of f(x, x^2) * f(x^4, x^8) / f(-x^3, -x^6)^2 in powers of x where f(, ) is Ramanujan's general theta function.at n=46A260183
- G.f. A(x) satisfies: Sum_{n>=0} A(x)^(n*(n+1)/2) * x^n = Sum_{n>=0} x^n / (1-x)^(n*(n-1)/2).at n=10A326423
- Numbers with digits in nondecreasing order whose digit sum is prime and whose digit product is a perfect square > 0.at n=43A344842
- Semiprimes of the form k^2 + 5.at n=36A361696
- G.f. A(x) satisfies A(x) = 1 / (1 - x - x^2 * A(x^3)).at n=18A367666