11307
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15080
- Proper Divisor Sum (Aliquot Sum)
- 3773
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7536
- Möbius Function
- 1
- Radical
- 11307
- 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
- 112
- 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
- Number of points in N^4 of norm <= n.at n=13A055403
- Position at which increasing values of the Improperly Reduced Fibonacci Sequence (A058981) occur.at n=18A058983
- Integers m such that the base-10 digit concatenation 2//m//3//m//5//m...//prime(49)//m//prime(50) is prime.at n=26A084048
- a(n)=number of Catalan knight paths in Quadrant I from (0,0) to points on the vertical line x=n. A Catalan knight moves (2 right and 1 up) or (1 right and 1 down).at n=11A096588
- Generating function = sum over all subsets S of the integers {0,1,2...} of 1/sum(1/x^n for n in S).at n=14A121268
- a(n) = 9*n^2 - 10*n + 3.at n=36A154262
- Expansion of 1/(1 - 3*x + x^2 - 2*x^3 + 2*x^4).at n=9A176880
- Number of distinct grids after n moves in the 4T version of Morpion Solitaire.at n=4A204110
- Number of (n+1) X (n+1) -5..5 symmetric matrices with every 2 X 2 subblock having sum zero and one or three distinct values.at n=8A211331
- Numbers k such that 8^k - 9 is prime.at n=15A217383
- Numbers k such that (11*10^k - 149)/3 is prime.at n=21A281486
- Number of nX7 0..1 arrays with every element unequal to 0, 1, 3 or 8 king-move adjacent elements, with upper left element zero.at n=7A304220
- Number of compositions (ordered partitions) of n into distinct parts having a common factor > 1 with n.at n=52A332003
- Admirable totient numbers: numbers that are equal to the sum of their iterated phi, with one of them taken with a minus sign.at n=39A335121
- Number of compositions of n into distinct parts, any two of which have a common divisor > 1.at n=52A337983
- Numbers k such that A361338(k) = 9.at n=13A361348
- a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared whose string value contains all the distinct prime factors of a(n-1). Overlapping factor strings is allowed.at n=40A365500
- Number of distinct non-subset-sums of integer partitions of n.at n=27A365918
- a(n) is the number of perfect powers m^k with k>=3 (A076467) <= 10^n.at n=12A377934