11137
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13376
- Proper Divisor Sum (Aliquot Sum)
- 2239
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9072
- Möbius Function
- -1
- Radical
- 11137
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 91
- 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
- Pseudoprimes to base 6.at n=30A005937
- Lucky numbers with size of gaps equal to 20 (lower terms).at n=23A031902
- Multiplicity of highest weight (or singular) vectors associated with character chi_5 of Monster module.at n=47A034393
- Divide natural numbers in groups with prime(n) elements and add together.at n=13A034957
- Second pentagonal numbers with even index: a(n) = n*(6*n+1).at n=43A049453
- Truncated triangular pyramid numbers: a(n) = Sum_{k=4..n} (k*(k+1)/2 - 9).at n=36A051937
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=25A070192
- Zeroless numbers for which the sum of the digits and the product of the digits are both Fibonacci numbers.at n=33A117725
- Lucky numbers for which both the sum of the digits and the product of the digits is also a lucky number.at n=16A118559
- Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)).at n=36A134602
- Mersenne numbers with digits sorted in increasing order and zeros suppressed.at n=16A135374
- a(n) = n*(8*n+5).at n=37A139277
- Products of three distinct primes of the form 6*k + 1.at n=23A154729
- Number generated by regarding the numbers in row n of A003983 as digits of a base n number.at n=5A157452
- Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence.at n=29A167519
- a(n) = 13*n^2 + 7*n + 1.at n=28A168240
- Numbers n not divisible by 2 or 3 such that k^k == k+1 (mod n) has no nonzero solutions.at n=47A191834
- Numbers having exactly four representations by the quadratic form x^2+xy+y^2 with 0<=x<=y.at n=30A198775
- Number of nX1 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor.at n=16A199126
- Number of (n+2)X(n+2) 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly one way, and new values 0..1 introduced in row major order.at n=3A204484