5731
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
- 4
- Divisor Sum
- 6264
- Proper Divisor Sum (Aliquot Sum)
- 533
- 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
- 5200
- Möbius Function
- 1
- Radical
- 5731
- 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
- 28
- 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
- a(n) = floor(Fibonacci(n)/5).at n=23A004698
- a(n) = floor(n*phi^13), where phi is the golden ratio, A001622.at n=11A004928
- a(n) = round(n*phi^13), where phi is the golden ratio, A001622.at n=11A004948
- Pseudoprimes to base 5.at n=13A005936
- Number of partitions of n into at most 7 parts.at n=39A008636
- Expansion of log(1+tan(x))*cosh(x).at n=7A009370
- Positive integers n such that 2^n == 2^11 (mod n).at n=59A015935
- Strong pseudoprimes to base 25.at n=7A020251
- Number of partitions of n in which the greatest part is 7.at n=46A026813
- Numbers k such that k*(k+2) is a palindrome.at n=16A028503
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 75.at n=10A031573
- Multiplicity of highest weight (or singular) vectors associated with character chi_97 of Monster module.at n=36A034485
- Numbers having three 7's in base 9.at n=20A043483
- a(n) = A047980(2n).at n=25A047981
- Prime 3-component links with n crossings.at n=12A048953
- Number of digits in n-th term of A001387.at n=21A049194
- a(n+1) = a(n) converted to base 10 from base 11.at n=49A055982
- Composite numbers not divisible by 5 which in base 5 contain their largest proper factor as a substring.at n=2A063889
- Composite numbers with all divisors congruent to 1 mod 10.at n=41A068872
- Sum of terms of continued fraction expansion of frac((3/2)^n).at n=49A071316