11742
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
- 16
- Divisor Sum
- 24960
- Proper Divisor Sum (Aliquot Sum)
- 13218
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3672
- Möbius Function
- 1
- Radical
- 11742
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 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
- Nearest integer to Gamma(n + 2/11)/Gamma(2/11).at n=9A020013
- Ceiling of Gamma(n+2/11)/Gamma(2/11).at n=9A020103
- Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram".at n=18A034587
- a(n) = floor(e*(n-1)*(n-1)!).at n=6A036918
- Expansion of (1-x)/(1-x-4x^2+2x^3).at n=12A052966
- a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.at n=34A060630
- Numbers n such that the numerator of BernoulliB[n] is divisible by 691.at n=41A119864
- Start with a(1)=1; now a(n+1)=a(n)+a(k) with k=[n-n-th digit of Pi]. If k<0 or k=0, then a(k)=0.at n=35A133389
- a(n) = n*(8*n+5).at n=38A139277
- Number of n X n 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=4A240147
- Number of nX5 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=4A240151
- T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=40A240153
- Number of 5Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=4A240157
- Number of maximal intersecting antichains of nonempty, non-singleton subsets of {1..n}.at n=6A326362
- Expansion of Sum_{0<i<j<k<l} q^(2*(i+j+k+l)-4)/( (1-q^(2*i-1))*(1-q^(2*j-1))*(1-q^(2*k-1))*(1-q^(2*l-1)) )^2.at n=25A365666
- a(n) = Sum_{j=1..n} Sum_{k=1..n} phi(2*j*k) / phi(k).at n=25A372664
- Numbers of uniquely embeddable planar connected graphs on n vertices.at n=8A372853