7657
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
- 8
- Divisor Sum
- 8960
- Proper Divisor Sum (Aliquot Sum)
- 1303
- 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
- 6480
- Möbius Function
- -1
- Radical
- 7657
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 83
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Oscillates under partition transform.at n=44A007211
- Number of partitions of n into at most 9 parts.at n=36A008638
- Pseudoprimes to base 30.at n=38A020158
- Pseudoprimes to base 56.at n=35A020184
- Pseudoprimes to base 87.at n=38A020215
- Pseudoprimes to base 88.at n=35A020216
- Strong pseudoprimes to base 87.at n=12A020313
- Strong pseudoprimes to base 88.at n=9A020314
- Numbers with exactly 7 1's in their ternary expansion.at n=24A023698
- n written in fractional base 8/7.at n=31A024649
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=47A024834
- a(n) = [ 2nd elementary symmetric function of {log(k)} ], k = 2,3,...,n.at n=41A025202
- Number of partitions of n in which the greatest part is 9.at n=45A026815
- Gaps of 6 in sequence A038593 (upper terms).at n=1A038652
- Triangle giving number of unbranched catapolytetragons, read by rows.at n=64A038766
- Numbers ending with '7' that are the difference of two positive cubes.at n=38A038862
- Numbers whose base-5 representation contains exactly three 1's and three 2's.at n=16A045232
- Numbers that are the sum of two (possibly negative) cubes in at least 2 ways.at n=26A051347
- a(n) = 4*n^2 - 10*n + 7.at n=44A054554
- Numbers k such that 3*13^k - 2 is prime.at n=9A058025