11694
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
- 8
- Divisor Sum
- 23400
- Proper Divisor Sum (Aliquot Sum)
- 11706
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3896
- Möbius Function
- -1
- Radical
- 11694
- 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
- 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
- Numbers k for which 8*k+1, 8*k+5, 8*k+7 and 8*k+11 are primes.at n=21A123983
- The sequence d[n] defined in A126939.at n=9A126943
- Number of permutations of 0..floor((n*9-1)/2) on even squares of an nX9 array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing.at n=3A215787
- T(n,k)=Number of permutations of 0..floor((n*k-1)/2) on even squares of an nXk array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing.at n=69A215788
- Number of permutations of 0..floor((4*n-1)/2) on even squares of an 4*n array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing.at n=8A215790
- Number of permutations of 0..floor((n*9-2)/2) on odd squares of an nX9 array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=3A215869
- T(n,k) = Number of permutations of 0..floor((n*k-2)/2) on odd squares of an n X k array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=69A215870
- Number of permutations of 0..floor((4*n-2)/2) on odd squares of an 4Xn array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=8A215872
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 158", based on the 5-celled von Neumann neighborhood.at n=31A270335
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 838", based on the 5-celled von Neumann neighborhood.at n=37A273681
- Numbers k such that (68*10^k + 1)/3 is prime.at n=20A281296
- G.f.: Sum_{n>=0} x^n * (1 + x^n)^n / (1 - x^(n+1))^(n+1).at n=46A325046
- Number of integer partitions of n with non-integer median of 0-prepended first differences.at n=45A360691