11667
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15560
- Proper Divisor Sum (Aliquot Sum)
- 3893
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7776
- Möbius Function
- 1
- Radical
- 11667
- 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
- 81
- 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 such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 72.at n=23A031570
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 72.at n=2A031750
- n plus a googol is prime.at n=35A049014
- a(n) = floor(47*(n-3/2)^(3/2)).at n=39A050256
- 53 'Reverse and Add' steps are needed to reach a palindrome.at n=1A065320
- Numbers k such that phi(k) is a perfect 5th power.at n=30A078165
- Beastly fax numbers: numbers containing the fax number of the Beast (667, one more than its regular number) in their decimal expansion.at n=21A138563
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (0, 0, 1), (0, 1, 1), (1, 1, 0)}.at n=7A151064
- Except for the first term the number in the sequence is the smallest number in a new cycle of a RATS sequence with a new destiny. The first term is the best analog of this for the "infinite cycle".at n=8A161592
- Numbers in cycles of RATS sequences.at n=15A161596
- Number of 5-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first and second differences in -n..n.at n=22A208972
- a(n) = 8*n^2 + 3*n + 1.at n=38A236267
- Numbers m, such that the smallest prime factor of 1+78557*2^m doesn't belong to the covering set {3, 5, 7, 13, 19, 37, 73}.at n=34A258095
- Composites whose prime factorization in base 6 is an anagram of the number in base 6.at n=38A260050
- G.f. A(x,y) satisfies: A(x,y) = x + A( x^2 + x*y*A(x,y)^2, y).at n=54A271868
- Numbers in 2-cycles of RATS sequences.at n=5A275218
- Positions of 3's in A264977; positions of 6's in A277330.at n=31A277713
- Numbers k such that (32*10^k - 77)/9 is prime.at n=16A290153
- Numbers k such that k!4 + 2^7 is prime, where k!4 = k!!!! is the quadruple factorial number (A007662).at n=18A291348
- Expansion of (1/(1 - x))*Sum_{k>=0} k!*x^(k*(k+1)/2)/Product_{j=1..k} (1 - x^j).at n=22A303664