11131
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11132
- 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
- 11130
- Möbius Function
- -1
- Radical
- 11131
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1349
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of form k^2 + k + 1.at n=33A002383
- a(n) = n^3 + n^2 - 1.at n=21A003777
- a(0) = a(1) = 0; for n >= 2, a(n)*2^(n+2) + 1 is the smallest prime factor of the n-th Fermat number F(n) = 2^(2^n) + 1.at n=10A007117
- Primes that contain digits 1 and 3 only.at n=12A020451
- Primes that remain prime through 3 iterations of function f(x) = 4x + 9.at n=29A023282
- Primes that remain prime through 4 iterations of function f(x) = 4x + 9.at n=5A023312
- Convolution of natural numbers with composite numbers.at n=32A023539
- Numbers whose product of digits is prime.at n=45A028842
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 90 ones.at n=2A031858
- Numbers having only digits 1 and 3 in their decimal representation.at n=32A032917
- Numbers with multiplicative digital root value 3.at n=11A034050
- Number of partitions in parts not of the form 21k, 21k+1 or 21k-1. Also number of partitions with no part of size 1 and differences between parts at distance 9 are greater than 1.at n=43A035979
- Numbers having four 1's in base 10.at n=14A043496
- Multiplicative primes: product of digits is a prime.at n=20A046703
- Multiplicative and additive primes: primes where the product and sum of digits are also prime.at n=11A046713
- Primes of form 210*p + 1 where p is a prime.at n=10A051648
- Numbers n such that sum of digits and product of digits are both prime.at n=18A052430
- Discriminants of imaginary quadratic fields with class number 25 (negated).at n=19A056987
- Primes which can be written as (b^k+1)/(b+1) for positive integers b and k.at n=40A059055
- Primes p such that x^53 = 2 has no solution mod p.at n=24A059258