5767
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5920
- Proper Divisor Sum (Aliquot Sum)
- 153
- 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
- 5616
- Möbius Function
- 1
- Radical
- 5767
- 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
- 54
- 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) = (8*n+1)*(8*n+7).at n=9A001533
- Products of 2 successive primes.at n=20A006094
- Number of compositions (ordered partitions) of n into squares.at n=27A006456
- Coordination sequence T2 for Zeolite Code EUO.at n=47A008097
- Least m such that if r and s in {1/3, 1/6, 1/9, ..., 1/3n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=33A024838
- 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=14A031573
- Squares of primes or products of pairs of consecutive primes.at n=41A033476
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 3 (mod 5).at n=54A035573
- Numbers k > 1 such that k mod ord2(k) is even, where ord2(k) is the order of 2 mod k.at n=4A036260
- Sum of remainders when n-th prime is divided by all preceding integers.at n=40A050482
- Cototient of 2^n - 1.at n=14A053288
- a(1)=2, a(n+1) is the smallest integer > a(n) such that the smallest prime factor of a(n+1) is the largest prime factor of a(n).at n=42A057602
- a(n) = 10*n^2 + 7.at n=24A061722
- Composite and every divisor (except 1) contains the digit 7.at n=27A062676
- Final terms of rows of triangle in A077172.at n=44A077174
- a(n) = A078152(2^n).at n=22A078157
- G.f.: (1-x+2*x^2+2*x^3+2*x^4-x^5+x^6)/((1-x)*(1-x^2)^2*(1-x^3)).at n=40A083709
- a(n) = (6*n+1)*(6*n+7).at n=12A085026
- Brilliant numbers (A078972) whose digital sum is also brilliant.at n=46A085648
- a(n) = a(n-1)+a(n-2)+a(n-3)+2 with a(0)=0, a(1)=0 and a(2)=1.at n=15A089068