11518
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
- 8
- Divisor Sum
- 18648
- Proper Divisor Sum (Aliquot Sum)
- 7130
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5304
- Möbius Function
- -1
- Radical
- 11518
- 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
- 112
- 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
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=34A034076
- Numbers k such that S(k+2) = d(k)+2, where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).at n=43A073535
- Smallest initial value k that reaches 1 in n steps when iterating the map m -> rad(m)-1, where rad(m) is the squarefree kernel of m (A007947).at n=19A075426
- Square spiral of sums of selected preceding terms, starting at 0 followed by 1 (a spiral Fibonacci-like sequence).at n=19A094769
- a(n) = n*(n+1)*(3*n^2+n-1)/6.at n=12A103220
- Numbers n with property that n^3+n^2+{3,5} are twin primes.at n=35A168254
- Second elementary symmetric function of the first n terms of (1,1,2,2,3,3,4,4,...).at n=22A203246
- Number of 0..2 arrays of length n+3 with sum no more than 4 in any length 4 subsequence (=50% duty cycle).at n=6A212226
- T(n,k)=Number of 0..2 arrays of length n+2*k-1 with sum no more than 2*k in any length 2k subsequence (=50% duty cycle).at n=34A212232
- Number of 0..2 arrays of length 6+2*n with sum no more than 2*n in any length 2n subsequence (=50% duty cycle).at n=1A212239
- Number of partitions p of n such that the number of numbers p having multiplicity 1 in p is not a part and the number of numbers having multiplicity > 1 is not a part.at n=44A241417
- T(n,k)=Number of length n+3 0..k arrays with no consecutive four elements summing to more than 2*k.at n=34A241964
- Number of length 7+3 0..n arrays with no consecutive four elements summing to more than 2*n.at n=1A241970
- a(n) = 36*n^2 - 8*n - 2 (n >=1).at n=17A304834
- Numbers k such that the largest prime divisor of k^4+1 is less than k.at n=11A309562
- Numbers k such that A335579(k) is divisible by at least one of the composites between prime(k) and prime(k+1).at n=10A335580
- G.f. A(x) satisfies: A(x) = Sum_{n>=0} x^(2*n)*A(x)^n / (1 - x^(n+1)*A(x)^(n+2)).at n=7A340355
- G.f. satisfies A(x) = 1 + x*A(x)^4 + x^2*A(x)^3.at n=6A367050