11167
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12040
- Proper Divisor Sum (Aliquot Sum)
- 873
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10296
- Möbius Function
- 1
- Radical
- 11167
- 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
- 68
- 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
- Least number m such that the Sigma-Harmonic sequence Sum_{k=1..m} 1/sigma(k) >= n.at n=6A074468
- Smallest k such that A061762(k) = n.at n=58A130858
- 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, 0), (0, 0, -1), (0, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=8A150048
- Number of nonempty subsets of {1, 2, ..., n} having pairwise coprime elements.at n=24A187106
- Number of nonempty subsets of {1, 2, ..., n} with <=10 pairwise coprime elements.at n=24A187271
- Number of terms of 2^j + 3^k <= 10^n.at n=39A219835
- a(n) is the least k such that f(a(n-1)+1) + ... + f(k) > f(a(n-2)+1) + ... + f(a(n-1)) for n > 1, where f(n) = 1/(n+5) and a(1) = 1.at n=7A225920
- Number of length n+4 0..6 arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=0A247925
- T(n,k)=Number of length n+4 0..k arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=15A247927
- Number of length 1+4 0..n arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=5A247928
- First row of spectral array W(e^gamma).at n=22A250255
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 537", based on the 5-celled von Neumann neighborhood.at n=22A272792
- Numbers k such that (5*10^k - 173)/3 is prime.at n=14A294727