7295
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8760
- Proper Divisor Sum (Aliquot Sum)
- 1465
- 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
- 5832
- Möbius Function
- 1
- Radical
- 7295
- 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
- 88
- 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) = ceiling(n*phi^13), where phi is the golden ratio, A001622.at n=14A004968
- a(n) = dot_product(1,2,...,n)*(7,8,...,n,1,2,3,4,5,6).at n=23A026049
- Base-6 palindromes that start with 5.at n=36A043014
- Numbers whose base-4 representation contains exactly two 1's and four 3's.at n=35A045123
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives k values.at n=14A054236
- Number of disconnected 3 X n binary matrices.at n=5A054421
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.at n=31A055468
- a(n) = n*(13*n^2 - 7)/6.at n=15A062025
- Convolution of A052701 (Catalan numbers multiplied by powers of 2) with powers of -1.at n=6A064306
- Numbers k such that phi(k) divides sigma(k+1) + sigma(k).at n=44A067246
- Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=28A075421
- a(n) = smallest k such that the base 4 Reverse and Add! trajectory of A075421(n) joins the trajectory of k.at n=28A091676
- Poincaré series [or Poincare series] (or Molien series) for a certain five-fold wreath product P_5.at n=37A091726
- Numbers k such that 2^(2*(k+1)) + 2^k - 1 is prime.at n=30A105181
- Let k be an m-digit integer. Then k is a Pithy number if the k-th m-tuple in the decimal digits of Pi (after the decimal point) is the string k.at n=4A109513
- Triangle built from partial sums of Catalan numbers multiplied by powers of nonpositive numbers.at n=38A112707
- a(n) = A113166(n) - Fibonacci(n-1), where Fibonacci(n) = A000045(n).at n=41A113486
- The number of primes between n and n^3 (with n and n^3 excluded).at n=41A117491
- A sequence of asymptotic density zeta(8) - 1, where zeta is the Riemann zeta function.at n=29A143034
- A144325(n) + A144313(n) + A144315(n).at n=16A144715