7613
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7968
- Proper Divisor Sum (Aliquot Sum)
- 355
- 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
- 7260
- Möbius Function
- 1
- Radical
- 7613
- 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
- 132
- 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
- Numbers k such that 15*2^k - 1 is prime.at n=30A002237
- Pseudoprimes to base 38.at n=41A020166
- Pseudoprimes to base 57.at n=41A020185
- Pseudoprimes to base 74.at n=36A020202
- Pseudoprimes to base 80.at n=42A020208
- Strong pseudoprimes to base 38.at n=14A020264
- Strong pseudoprimes to base 57.at n=10A020283
- Strong pseudoprimes to base 61.at n=8A020287
- Strong pseudoprimes to base 85.at n=8A020311
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=45A024843
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (primes).at n=27A024867
- a(n) = n*(2*n^2 - 3*n + 4)/3.at n=23A037235
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 14.at n=33A050963
- a(n) = 4*n^2 - 3*n + 1.at n=44A054552
- Numbers k such that 7*2^k + 5 is prime.at n=19A058595
- a(n) = (2*n-1)*(5*n^2-5*n+2)/2.at n=11A063495
- Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.at n=39A064907
- Nonprimes k such that k divides 3^(k-1) - 2^(k-1).at n=21A073631
- Semiprimes in A054552.at n=14A113690
- Start with 1 and repeatedly reverse the digits and add 56 to get the next term.at n=17A118152