11170
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20124
- Proper Divisor Sum (Aliquot Sum)
- 8954
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4464
- Möbius Function
- -1
- Radical
- 11170
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- Values of A038007 not ending in 6 or 8.at n=18A038009
- a(n) = smallest number > a(n-1) such that a(1)*a(2)*...*a(n) + 1 and a(1)*a(2)*...*a(n) - 1 are primes.at n=30A051956
- Number of basis partitions of n+49 with Durfee square size 7.at n=24A053802
- a(n) = a(n-1)+ceiling(a(n-2)/2) with a(0)=0, a(1)=1.at n=30A064323
- Record entries in A065194.at n=8A065195
- Index of first occurrence of n-th prime in A001203, the continued fraction for Pi.at n=28A107892
- a(n) = a(n-1) + a(n-2) - floor(a(n-2)/2), starting 2,1.at n=29A173497
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=17A191111
- Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,3,9, Q starts with 2,6, R starts with 4; at each stage the smallest number not yet present in P,Q,R is appended to R. Sequence gives P.at n=35A225385
- The number of matchings in the n-flower graph.at n=3A236549
- Number of partitions p of n such that 2*(number of even numbers in p) <= (number of odd numbers in p).at n=40A241652
- Number of length n 0..5 arrays with new values introduced in order from both ends, and least squares fitting to a straight line with slope zero, with a single point taken as having zero slope.at n=13A245848
- a(n) is the smallest positive integer m such that if k >= m then a(k+1,n)^(1/(k+1)) <= a(k,n)^(1/k), where a(k,n) is the k-th term of the sequence {p | p and p+2n are primes}.at n=75A248855
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 646", based on the 5-celled von Neumann neighborhood.at n=37A273328
- Partial sums of A301692.at n=81A301693
- Number of n X 7 0..1 arrays with every element equal to 0, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A302211
- Number of 6 X n 0..1 arrays with every element equal to 0, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=6A302216
- Numbers m such that m^2+1 is prime with (m-1)^2+1 and (m+1)^2+1 semiprimes.at n=24A321795
- Number of partitions of n into 6 or more distinct parts.at n=43A347573