11059
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
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11060
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11058
- Möbius Function
- -1
- Radical
- 11059
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1340
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 68 ones.at n=6A031836
- Recursive prime generating sequence.at n=47A039726
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of order two under binary matrix multiplication.at n=6A054466
- Fifth term of strong prime quintets: p(m-3)-p(m-4) > p(m-2)-p(m-3) > p(m-1)-p(m-2) > p(m)-p(m-1).at n=27A054812
- Discriminants of imaginary quadratic fields with class number 25 (negated).at n=18A056987
- Smallest prime p such that x = n is a solution mod p of x^3 = 2, or 0 if no such prime exists.at n=46A059940
- a(n) = least odd number which can be represented in the form p + 2*k^2, k>0, in n different ways.at n=44A060004
- Primes with 10 as smallest positive primitive root.at n=29A061323
- Primes such that the sum of the predecessor and successor primes is divisible by 37.at n=36A113156
- Cyclops primes.at n=18A134809
- Primes of the form 10x^2+10xy+139y^2.at n=39A140019
- Primes congruent to 33 mod 37.at n=37A142142
- Primes congruent to 30 mod 41.at n=35A142227
- Primes congruent to 8 mod 43.at n=33A142257
- Primes congruent to 14 mod 47.at n=30A142365
- Primes congruent to 34 mod 49.at n=34A142443
- Primes congruent to 43 mod 51.at n=41A142502
- Primes congruent to 35 mod 53.at n=24A142565
- Primes congruent to 4 mod 55.at n=36A142604
- Primes congruent to 1 mod 57.at n=33A142665