7359
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10752
- Proper Divisor Sum (Aliquot Sum)
- 3393
- 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
- 4440
- Möbius Function
- -1
- Radical
- 7359
- 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
- 145
- 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
- Convolution of A023531 and Lucas numbers.at n=18A023558
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=29A052049
- Number of 3 X n binary matrices such that any 2 rows have a common 1, up to column permutations.at n=9A052387
- Esanacci (hexanacci or "6-anacci") numbers.at n=13A074584
- Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square at mid-side.at n=27A089483
- Draw a line through every pair of points with coordinates (x, 1) and (x', 2) with x, x' in 1..n, and then count the number of intersection points above the line y = 2.at n=17A092275
- Starting numbers for which the RATS sequence has eventual period 14.at n=4A114615
- Numbers n such that f(n), f(n+1) and f(n+2) are prime, f(m)=72*m^2+7.at n=12A121089
- Numbers k such that k!! - 2^k is prime.at n=19A124249
- Numbers k such that binomial(3k, k) - 1 is prime.at n=21A125220
- Measures of entanglement in 3-qbits.at n=17A129548
- Weak Goodstein sequence starting at 11.at n=30A137411
- Expansion of Molien series for the ring of genus 5 code polynomials for Type II codes.at n=13A144060
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (0, 0, -1), (0, 1, -1), (1, 0, 1)}.at n=9A148624
- Partial sums of ceiling(n^2/4).at n=44A175287
- Numbers n for which A222085(n)=A222085(n+1).at n=12A222088
- Triangle read by rows: T(n,k) is the number of descent sequences of length n with exactly k-1 descents, n>=1, 1<=k<=n.at n=48A225624
- Numbers n such that n^10+10 is prime.at n=14A239347
- a(n) = n*(n+1)*(n+2)*(n+3)*(2*n^2+6*n+7)/360.at n=9A259181
- Expansion of Product_{k>=0} 1/(1-x^(4*k+1))^3.at n=26A261632