11309
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11616
- Proper Divisor Sum (Aliquot Sum)
- 307
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11004
- Möbius Function
- 1
- Radical
- 11309
- 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 partitions of floor(7n/2)-1 into n nonnegative integers each no greater than 7.at n=18A001980
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 54 ones.at n=37A031822
- Position at which increasing values of the Improperly Reduced Fibonacci Sequence (A058981) occur.at n=19A058983
- a(n) = floor(surface area of a sphere with radius n).at n=29A066644
- a(n) = 17 + floor( (1 + Sum_{j=0..n-1} a(j))/2 ).at n=16A120143
- a(n) = Sum_{d divides n} d*(n/d)^(d-1).at n=21A167531
- Number of Carmichael numbers between 2^n and 2^(n+1).at n=45A182490
- Second 14-gonal numbers: n*(6*n+5).at n=43A211014
- a(n) = ceiling(e^(n/3)).at n=27A214076
- Indices of records in A159918.at n=18A230097
- a(n) = smallest m such that wt(m^2) = n (where wt(i) = A000120(i)), or -1 if no such m exists.at n=21A231897
- Sum of squares of numbers less than n that do not divide n.at n=32A276984
- Numbers having in binary representation more zeros than their squares.at n=2A293655
- Partial sums of A299279.at n=16A299280
- Odd composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 7 (mod m), where U(m)=A004187(m) and V(m)=A056854(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=7 and b=1, respectively.at n=31A337781
- Odd composite integers m such that A005248(2*m-J(m,5)) == 3 (mod m), where J(m,5) is the Jacobi symbol.at n=34A339521
- Odd composite integers m such that A056854(2*m-J(m,45)) == 7 (mod m) and gcd(m,45)=1, where J(m,45) is the Jacobi symbol.at n=40A339523
- Odd composite integers m such that A001906(m-J(m,5)) == 0 (mod m) and gcd(m,5)=1, where J(m,5) is the Jacobi symbol.at n=22A340097
- Odd composite integers m such that A004187(m-J(m,45)) == 0 (mod m) and gcd(m,45)=1, where J(m,45) is the Jacobi symbol.at n=21A340099
- Odd composite integers m such that A004187(2*m-J(m,45)) == J(m,45) (mod m) and gcd(m,45)=1, where J(m,45) is the Jacobi symbol.at n=27A340124