5281
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5282
- 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
- 5280
- Möbius Function
- -1
- Radical
- 5281
- 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
- yes
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 701
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=30A001583
- From a Goldbach conjecture: records in A185091.at n=34A002092
- Numbers k such that k^4 can be written as a sum of four positive 4th powers.at n=33A003294
- Coordination sequence T7 for Zeolite Code EUO.at n=45A008102
- Coordination sequence T1 for Zeolite Code MEP.at n=43A008157
- Coordination sequence T3 for Zeolite Code MTT.at n=45A008191
- Coordination sequence T2 for Scapolite.at n=46A008263
- 3 and -3 are both 4th powers (one implies other) mod these primes p=1 mod 8.at n=38A014755
- Numbers k such that the continued fraction for sqrt(k) has period 33.at n=18A020372
- Primes that remain prime through 3 iterations of function f(x) = 2x + 5.at n=22A023274
- Lower prime of a pair of consecutive primes having a difference of 16.at n=17A031934
- Numbers k such that k^4 can be written as a sum of four positive 4th powers with no common factor.at n=11A039664
- Denominators of continued fraction convergents to sqrt(682).at n=8A042311
- T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=42A046802
- T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=38A046802
- a(n) = Sum_{i=1..n} T(i,n-i), where T is A049615.at n=40A049616
- a(n)=T(n,n+2), array T as in A049735.at n=28A049742
- Fifth term of strong prime quintets: p(m-3)-p(m-4) > p(m-2)-p(m-3) > p(m-1)-p(m-2) > p(m)-p(m-1).at n=13A054812
- a(n) = least odd number which can be represented in the form p + 2*k^2, k>0, in n different ways.at n=34A060004
- Positive numbers whose product of digits is 5 times their sum.at n=38A062382