11062
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16596
- Proper Divisor Sum (Aliquot Sum)
- 5534
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5530
- Möbius Function
- 1
- Radical
- 11062
- 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
- 42
- 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
- T(2n+1,n+4), T given by A026780.at n=5A026901
- Number of primes p such that n!-p is prime.at n=9A140088
- Number of distinct solutions of Sum_{i=1..2} (x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1.at n=39A180773
- Numbers k such that sum_{i=1..k} d(i)^2 is a square c^2, where d(i) is the number of divisors of i.at n=14A186429
- The Wiener index of the graph obtained by applying Mycielski's construction to the path graph on n vertices (n>=2).at n=42A228321
- Expansion of Product_{k>=1} ((1 - 2^k*x^k)/(1 + 2^k*x^k))^(1/2^k).at n=16A303439
- Least integer N > 2 such that the number of primes (<=N) <= the number of base-n-zero containing numbers (<=N).at n=20A306521
- Numbers m > 3 such that m-1, m, m+1 belong to A307002.at n=38A340748
- T(n,k) = coefficient of x^n*y^k in A(x,y) such that: x = Sum_{n=-oo..+oo} (-1)^n * x^n * (y + x^n)^n * A(x,y)^n.at n=38A359720
- a(n) = A359720(n+2,1), for n >= 0.at n=8A359725
- Triangle read by rows. T(n, k) is the number of Fibonacci meanders with a central angle of 360/m degrees that make m*k left turns and whose length is m*n, where m = 3.at n=48A361681
- Number of integer partitions of n with superdiagonal run-lengths.at n=51A388714