11762
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17646
- Proper Divisor Sum (Aliquot Sum)
- 5884
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5880
- Möbius Function
- 1
- Radical
- 11762
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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) = 1, a(n) = 15*n^2 + 2 for n>0.at n=28A010005
- Smallest value of x such that M(x) = n, where M() is Mertens's function A002321.at n=37A051400
- Fifth column of triangle A055252.at n=7A055581
- a(n) = sum_{k=1..n} prime(k)*prime(k+1).at n=14A074745
- Number of permutations of length n which avoid the patterns 213, 1234, 2431.at n=13A116726
- Triangle read by rows: T(n,k) = is the number of directed column-convex polyominoes of area n having along the lower contour exactly k reentrant corners, i.e., a vertical step that is followed by a horizontal step (n >= 1, k >= 0).at n=38A121466
- Least semiprime s for which the Mertens function M(s) = n.at n=41A123173
- Riordan array (1/(1-2x), x/((1-x)(1-2x))).at n=47A124237
- Number of permutations of length n whose associated Schubert variety is defined by inclusions.at n=8A213090
- Number of partitions of n such that the multiplicity of the greatest part is a part.at n=35A240494
- Number of (n+2) X (5+2) 0..3 arrays with every 3 X 3 subblock row and column sum not 2 3 6 or 7 and every diagonal and antidiagonal sum 2 3 6 or 7.at n=6A251891
- Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and column sum not 2 3 6 or 7 and every diagonal and antidiagonal sum 2 3 6 or 7.at n=4A251893
- Pseudoprimes to base 9, written in base 9.at n=45A262154
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 139", based on the 5-celled von Neumann neighborhood.at n=25A270280
- T(n, k) = binomial(2*n - k, k - 1)*hypergeom([2, 2, 1 - k], [1, 2*(1 - k + n)], -1), triangle read by rows, T(n,k) for n >= 0 and 0 <= k <= n.at n=53A320906
- 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=28A353055
- a(0) = 1; thereafter a(n) = 5*n^2 - 5*n + 2.at n=49A386485