11663
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
- 4
- Divisor Sum
- 11880
- Proper Divisor Sum (Aliquot Sum)
- 217
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11448
- Möbius Function
- 1
- Radical
- 11663
- 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
- 50
- 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
- Products of 2 successive primes.at n=27A006094
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 3 (mod 5).at n=48A035567
- Numbers that are the product of a pair of twin primes.at n=9A037074
- Numerators of continued fraction convergents to sqrt(238).at n=7A041444
- Numerators of continued fraction convergents to sqrt(952).at n=7A042842
- Numbers having four 5's in base 6.at n=27A043392
- Numbers k such that k^8 == 1 (mod 9^3).at n=31A056084
- Nonprimes m such that phi(m)*sigma(m) is divisible by m+1.at n=40A065148
- a(n) is the smallest k such that (k^5 + 1)/(n^5 + 1) is an integer > 1.at n=25A066020
- Nonprime solutions to k == -1 (mod phi(k+1)).at n=34A067930
- Composite numbers k that divide Fibonacci(k+1).at n=7A069107
- Product of twin primes of form (4*k+3,4*(k+1)+1), k>=0.at n=4A071700
- Multiplicative closure of twin prime pair products (A037074).at n=19A074480
- Sum of next n integer interprimes (cf. A024675).at n=15A075673
- Squarefree numbers k such that A076341(k) = 0.at n=12A076352
- Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5).at n=10A081264
- Numbers n such that n+1 and phi(n)+1 are both perfect squares.at n=18A089952
- Numbers k such that k+1 and sigma(k)+1 are both perfect squares.at n=13A089954
- Indices of terms in A091074 which are prime numbers.at n=35A091076
- Numbers k such that k, k+2, k+4, k+6, k+8 are semiprimes.at n=38A092127