11766
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24624
- Proper Divisor Sum (Aliquot Sum)
- 12858
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- 1
- Radical
- 11766
- 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
- 143
- 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(n) = (7*n+1)*(7*n+6).at n=15A001526
- Positive numbers k such that k and 5*k are anagrams in base 8 (written in base 8).at n=8A023076
- Numbers k such that 7^k == -1 (mod k-1).at n=14A055690
- a(n) = (5*n+1)*(5*n+6).at n=21A085025
- Cardinality of set of sets of parts of all partitions of n.at n=44A088314
- Fourth column (m=3) of (1,6)-Pascal triangle A096956.at n=35A096957
- 4-almost primes equal to the product of two successive semiprimes.at n=34A108215
- a(n) = number of 8-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..71].at n=37A178879
- 1/36 the number of (n+2) X (n+2) 0..2 arrays with each 3 X 3 subblock containing two of one value, two of another, and five of the last.at n=3A184448
- 1/36 the number of (n+2)X6 0..2 arrays with each 3X3 subblock containing two of one value, two of another, and five of the last.at n=3A184452
- T(n,k)=1/36 the number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock containing two of one value, two of another, and five of the last.at n=24A184457
- Number of (w,x,y,z) with all terms in {1,...,n} and w^2<=x*y*z.at n=11A212065
- Coefficients of mock modular form H_1^(4) (divided by 2).at n=14A256051
- Coefficients of mock modular form H_1^(2) of type 2A, divided by 2.at n=28A256059
- Numbers k such that 4*10^k + 19 is prime.at n=26A271548
- a(n) = prime(n) + prime(n+1) * prime(n+2).at n=26A293206
- a(n) = 16*3^n + 2^(n+1) - 26 (n>=1).at n=5A304169
- Row sums of A323179.at n=26A323180
- G.f.: Product_{k>=1} Sum_{n>=0} x^(k*n) / (1 - x^(n+k)).at n=20A341959
- Successive records of function f(x) = log(abs(pi(x) - R(x)))/log(x) where pi(x) is the number of primes <= x and R(x) is Riemann's prime counting function.at n=32A353055