11067
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18432
- Proper Divisor Sum (Aliquot Sum)
- 7365
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- 1
- Radical
- 11067
- 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
- 42
- 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
- no
- Odd
- yes
Appears in sequences
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=41A003452
- Self-convolution of numbers of preferential arrangements.at n=6A006957
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=34A007419
- a(n) = n*(23*n + 1)/2.at n=31A022281
- Expansion of Product_{m>=1} (1+x^m)^21.at n=4A022586
- Least term in period of continued fraction for sqrt(n) is 5.at n=37A031429
- 5x - 1 sequence starting at 19 (a(n+1) = a(n)/2 if a(n) is even, or 5*a(n)-1 if a(n) is odd).at n=24A037238
- Base 6 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,3.at n=5A037606
- Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=14A045277
- Numbers n such that 259*2^n-1 is prime.at n=17A050888
- Numbers k such that phi(k)*d(k) is a multiple of sigma(k), where d(k) is the number of divisors of k.at n=40A050934
- Numbers n such that both n^4 + 2 and n^4 - 2 are prime.at n=42A071351
- To obtain a(n+1), take the square of the n-th partial sum, minus the sum of the first n squared terms, then divide this difference by a(n); for all n>1, starting with a(0)=1, a(1)=1.at n=13A087640
- Draw a line through every pair of points with coordinates (x, 1) and (x', 2) with x, x' in 1..n, and then count the number of intersection points above the line y = 2.at n=19A092275
- Numerator of imaginary part of (3*i - 1)^(-n).at n=16A124871
- a(n) = 25*n^2 + 2*n.at n=20A154377
- Numbers k for which 5*k-4, 5*k-2, 5*k+2, and 5*k+4 are primes.at n=25A178082
- Number of 5-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=14A187379
- Sum of the even-indexed parts of all partitions of n.at n=22A207382
- Number of nX3 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 0 1 0 vertically.at n=6A207421