11166
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22344
- Proper Divisor Sum (Aliquot Sum)
- 11178
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3720
- Möbius Function
- -1
- Radical
- 11166
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- yes
- Odd
- no
Appears in sequences
- Fibonacci sequence beginning 1, 29.at n=14A022399
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A000201 (lower Wythoff sequence).at n=21A024474
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = A000201 (lower Wythoff sequence).at n=20A025094
- 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 70.at n=30A031568
- Weight of the alternating group (A_n) in transpositions.at n=6A067369
- Numbers n such that pi(n) = prime(d_1)*prime(d_2)*...*prime(d_k) where d_1 d_2 ... d_k is the decimal expansion of n.at n=2A098683
- Sum of primes p with n^2 < p < (n+1)^2.at n=32A108314
- Expansion of 1/(sqrt(1-4*x)*(1-3*x*c(x))), where c(x) is the g.f. of A000108.at n=6A141223
- Numbers n such that pi(n) = prime(d_1)*prime(d_2)* ... *prime(d_k), where d_1, d_2, ... d_k is the decimal expansion of n, and the zeroth prime is 1.at n=4A160040
- Number of 0..n arrays x(0..3) of 4 elements without any two consecutive increases or two consecutive decreases.at n=10A200839
- G.f.: ((1+2*x)*sqrt(1-6*x^2+x^4)-1+5*x^2-2*x^3)/(2*x*(1-6*x^2)).at n=13A212205
- a(n) = A212205(2*n + 1).at n=6A225887
- Sequence of distinct least nonnegative numbers such that the average of the first n terms is a Fibonacci number.at n=27A249265
- Number of (n+2) X (7+2) 0..3 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=17A252718
- a(0) = a(1) = 1, and a(n) = a(n-1) + a( (a(n-1)-1) mod n ) for n>=2.at n=32A268176
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 449", based on the 5-celled von Neumann neighborhood.at n=26A272254
- Numbers using only digits 1 and 6.at n=33A284293
- Numbers that contain exactly one pair of identical digits x and a triple of identical digits y (x not equal y).at n=14A291312
- Number of compositions of n such that every distinct consecutive subsequence has a different sum.at n=30A325676
- Numbers k such that k and k + 1 are both binary Smith numbers (A278909).at n=37A331464