7303
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7480
- Proper Divisor Sum (Aliquot Sum)
- 177
- 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
- 7128
- Möbius Function
- 1
- Radical
- 7303
- 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
- 163
- 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 the continued fraction for sqrt(k) has period 62.at n=30A020401
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 31 ones.at n=0A031799
- Generalized Pellian with second term equal to 7.at n=9A048694
- Numbers k such that 3*2^k + 35 is prime.at n=42A059759
- Products of Wythoff pairs: [n*r]*[n*r^2], where [] is the floor function and r is the golden ratio, (1+sqrt(5))/2.at n=41A075312
- Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) =(b(n)*x + a(n))/(c(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.at n=10A075828
- Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) = (b(n)*x + c(n))/(d(n)*x + a(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.at n=11A075829
- Bisection (odd part) of Chebyshev sequence with Diophantine property.at n=4A077239
- Combined Diophantine Chebyshev sequences A077240 and A077239.at n=9A077242
- Number of nonisomorphic graphic matroids (by rank or number of vertices).at n=6A078639
- First differences of A084449.at n=30A084465
- Numbers k such that 4^k + 9i is a Gaussian prime.at n=22A084541
- Golden semiprimes that are not brilliant numbers.at n=1A107787
- Golden semiprimes: a(n)=p*q and abs(p*phi-q)<1, where phi = golden ratio = (1+sqrt(5))/2.at n=9A108540
- Least positive k such that 2^n + k is a Chen prime and 2^n + k + 2 is a brilliant number.at n=45A109364
- a(n) is the difference between denominator and numerator of the n-th alternating harmonic number Sum_{k=1..n} (-1)^(k+1)/k = A058313(n)/A058312(n).at n=10A119248
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 1), (0, -1), (0, 1), (1, 0)}.at n=9A151412
- Numbers n whose square can be represented as a repdigit number in some base less than n.at n=33A158235
- Primitive numbers in A158235.at n=15A158245
- a(n)=a(n-1)+ p, where p is the least prime whose first digit equals the first digit of a(n-1) and p>=a(n-1).at n=10A175523