11301
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15072
- Proper Divisor Sum (Aliquot Sum)
- 3771
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7532
- Möbius Function
- 1
- Radical
- 11301
- 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
- 86
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 70.at n=35A031568
- Number of primes less than 10000n.at n=11A038813
- Tricoverings of an n-set.at n=5A060486
- Numbers n such that mu(n) + mu(n+1) + mu(n+2) + mu(n+3) + mu(n+4) + mu(n+5) + mu(n+6) = 6.at n=12A082967
- Sequence A085188 shown in factorial base. (The longest prefix which can be shown with digits < 10.)at n=36A085187
- a(n)=floor{square((1*n^0+1*n^1+2*n^2+4*n^3)/(1*n^0+2*n^1+1*n^2))}.at n=27A086863
- Expansion of 1 / Product_{n>=0} (1 - q^(5n+1))*(1 - q^(5n+2))*(1 - q^(5n+4)).at n=48A107235
- Triangle of numbers T(n,k) (n>=0, n>=k>=0) of transitive reflexive early confluent binary relations R on n labeled elements where k=max_{x}(|{y : xRy}|), read by rows.at n=26A135313
- T(n,k) is the number of (n*k) X k binary arrays with nonzero rows in decreasing order and n ones in every column.at n=23A188445
- Numbers k such that 6k+1, 12k+1, 18k+1 and 36k+1 are all primes.at n=43A206024
- Number of 4 X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=7A207684
- Primes written in the factorial base.at n=37A214617
- Number of transitive reflexive early confluent binary relations R on n labeled elements with max_{x}(|{y : xRy}|) = 5.at n=1A218095
- Number of transitive reflexive early confluent binary relations R on n+1 labeled elements with max_{x}(|{y : xRy}|) = n.at n=5A218111
- Number of partitions of n such that the sum of squares of the parts is a square.at n=55A240127
- Number of odd terms in f^n, where f = x^4*y^4 + x^4*y^3 + x^3*y^4 + x^4*y^2 + x^2*y^4 + x^4*y + x^3*y^2 + x^2*y^3 + x*y^4 + x^4 + x^2*y^2 + y^4 + x^3 + x^2*y + x*y^2 + y^3 + x^2 + y^2 + x + y + 1.at n=45A246034
- Partial sums of A255744.at n=18A255765
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 353", based on the 5-celled von Neumann neighborhood.at n=26A281287
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 353", based on the 5-celled von Neumann neighborhood.at n=28A281287
- Number of n-regular hypergraphs on 5 labeled vertices.at n=3A331127