11302
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
- 4
- Divisor Sum
- 16956
- Proper Divisor Sum (Aliquot Sum)
- 5654
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5650
- Möbius Function
- 1
- Radical
- 11302
- 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
- yes
- Odd
- no
Appears in sequences
- Number of n-node graphs without isolated nodes.at n=8A002494
- Expansion of Product_{m>=1} (1-m*q^m)^-10.at n=5A022734
- Numbers whose base-7 representation contains exactly four 4's.at n=25A043412
- Coefficients of monic primitive irreducible polynomials over GF(4) listed in lexicographic order.at n=34A058952
- a(n) = ceiling(((1*n^0 + 1*n^1 + 2*n^2 + 4*n^3)/(1*n^0 + 2*n^1 + 1*n^2))^2).at n=27A085505
- Greatest number having exactly n representations as ab+ac+bc with 1 <= a <= b <= c.at n=12A094380
- Expansion of g.f. -(1+x^2+x^4)/((x^3+x^2+x-1)*(x-1)^2).at n=13A104187
- Number of nondecreasing arrangements of n+3 numbers in 0..3 with each number being the sum mod 4 of three others.at n=35A183898
- Triangular array read by rows: T(n,k) is the number of unlabeled simple graphs with n nodes that have exactly k isolated nodes, (n>=0, 0<=k<=n).at n=36A217653
- Triangular array read by rows: T(n,k) is the number of unlabeled simple graphs with n nodes that have exactly k isolated nodes, (n>=0, 0<=k<=n).at n=46A217653
- Triangular array read by rows: T(n,k) is the number of unlabeled simple graphs with n nodes that have exactly k isolated nodes, (n>=0, 0<=k<=n).at n=57A217653
- Number of (n+2)X(6+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=13A254905
- Numbers k such that 2*10^k + 93 is prime.at n=24A275523
- Regular triangle where T(n,k) is the number of unlabeled k-uniform hypergraphs spanning n vertices.at n=29A301922
- Triangle read by rows where T(n,k) is the number of unlabeled simple graphs covering n vertices with vertex-connectivity >= k.at n=36A327365
- a(n) is the smallest k >= 1 such that i^2 + k is not divisible by any of the first n odd primes, for any integer i.at n=11A375210
- a(n) is the smallest k >= 1 such that i^2 + k is not divisible by any of the first n odd primes, for any integer i.at n=12A375210
- a(n) is the smallest possible side x in a family of triangles with integer sides x, y < x, x-y < z < x+y, such that exactly n pairs of triangles with equal area exist in this family.at n=45A375748