11338
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17010
- Proper Divisor Sum (Aliquot Sum)
- 5672
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5668
- Möbius Function
- 1
- Radical
- 11338
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 81
- 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
- Number of irreducible positions of size n in Montreal solitaire.at n=9A007046
- Numbers k such that the continued fraction for sqrt(k) has period 35.at n=25A020374
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 4 (mod 5).at n=58A035574
- Smallest number m with nonzero digits such that A046810(m)=n.at n=13A046813
- INVERTi transform of A000081 = [1, 2, 4, 9, 20, 48, 115, 286, 719, 1842, 4766, 12486,...].at n=13A051573
- Numbers k such that k^128 + 1 is prime.at n=28A056994
- a(n) = Sum_{k=1..n} Sum_{j=1..k} (prime(k) - prime(j))^2.at n=10A062022
- Zero, together with positive numbers k such that prime(k) + k is a square.at n=39A064371
- Number of partitions of n with nonnegative crank.at n=37A064428
- Total number of parts in all partitions of n into odd parts.at n=39A067588
- Sum of n-th prime squared and n-th perfect square.at n=26A106587
- Numbers n such that prime(n) + n is a perfect power.at n=44A107605
- 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=46A108567
- One fifth of the sum of the first n primes, when an integer.at n=23A112271
- Triangle read by rows: row n gives coefficients of expansion of q-tangent number T_{2n+1}(q) in powers of q.at n=41A143194
- Triangle read by rows: row n gives coefficients of expansion of q-tangent number T_{2n+1}(q) in powers of q.at n=54A143194
- Triangle read by rows: T(n,k) = Sum_{c in C(n,k)} lcm(c) where C(n,k) is the set of all k-subsets of {1,2,...,n}.at n=42A181853
- Number of (n+2)X7 0..3 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..3 introduced in row major order.at n=5A204480
- Number of (n+2)X8 0..3 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..3 introduced in row major order.at n=4A204481
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7.at n=10A252400