11334
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 11346
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3776
- Möbius Function
- -1
- Radical
- 11334
- 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
- 130
- 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
- Number of partitions of 1/n into 4 reciprocals of positive integers.at n=15A020327
- a(n) = [ 2nd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=35A025193
- Zeckendorf expansion of n: repeatedly subtract the largest Fibonacci number you can until nothing remains. Little-endian concatenation of decimals.at n=48A035515
- Numbers k such that k*prime(k) -+ 1 are twin primes.at n=41A085637
- Numbers n such that n/6 and prime(n)+/-n are all primes.at n=20A105550
- a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, a(5) = 8, a(6) = 16, for n>5: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) + a(n-6)], where SORT places digits in ascending order and deletes 0's.at n=29A108567
- Numbers n such that primorial(n)/2 + 8 is prime.at n=23A139441
- Triangle T(n, k) = n!*Sum_{j=k..n} (-1)^(j+k)*binomial(k+j, j)/j!, read by rows.at n=31A156984
- Number of days after Jan 01 1000 such that the date written in the format DDMMYYYY is palindromic.at n=11A210885
- Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=3A252452
- Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=2A252453
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=17A252457
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=18A252457
- Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j-1,-n-1)*S2(k,j), S2 the Stirling set numbers A048993, for n>=0 and 0<=k<=n.at n=42A271702
- Positions of records in A366091.at n=42A366065
- Array read by falling antidiagonals: T(n,k) = numerator(Sum_{x>0} (x^n)/(k^x)); n >= 0 and k >= 2.at n=50A374895