5309
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5310
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5308
- Möbius Function
- -1
- Radical
- 5309
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 54
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 704
- 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 period 9.at n=30A010339
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ n/k ] ].at n=37A024932
- Lower prime of a pair of consecutive primes having a difference of 14.at n=29A031932
- Number of partitions of n into parts 3k or 3k+2.at n=51A035361
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 11.at n=18A050960
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives j values.at n=32A053720
- Primes arising in A053782.at n=18A053872
- Column 2 of triangle A055907.at n=21A055908
- Lesser of two consecutive primes such that p + n*q is a perfect square, p < q.at n=24A064543
- Number of partitions of n in which no part appears more than twice and no two parts differ by 1.at n=52A070047
- A partial product representation of f(n) = A015523(n) and L(n) = A072263(n).at n=17A072271
- Primes of the form x^2 + (x+3)^2.at n=14A076727
- a(n) = prime(n*(n+1)/2 + 1).at n=37A078721
- Union of A080105 and A080106.at n=34A080078
- a(n) = round(113*phi^n).at n=20A080105
- a(n) = r-th prime of the form (p-q)/(q-r) with r=prime(n+1), q=prime(n+2), and primes p > q.at n=32A089577
- Primes p == 1 (mod 4) such that (p-1)/4 is prime.at n=39A090866
- Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product +1 is prime. Sequence contains the primes arising as the sum of the terms of groups.at n=21A092946
- Primes p such that (pp'-1)/2 is prime, where p' denotes the next prime after p.at n=40A093706
- Smallest prime having exactly n representations as a^2+b^2+c^2 with c >= b >= a > 0.at n=26A094714