7357
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8416
- Proper Divisor Sum (Aliquot Sum)
- 1059
- 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
- 6300
- Möbius Function
- 1
- Radical
- 7357
- 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
- a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=a(2)=1 and a(3)=7.at n=12A024733
- a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=a(2)=1 and a(3)=7.at n=11A024955
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 52 ones.at n=15A031820
- Multiples of 7 using only prime digits (2, 3, 5 and 7).at n=42A077536
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={0,1}.at n=14A079994
- a(n) = (2^(semiprime(n)-1)) modulo (semiprime(n)^2).at n=42A115948
- Sum of the sizes of the tails below the Durfee squares of all partitions of n.at n=21A116365
- Start with 1 and repeatedly reverse the digits and add 35 to get the next term.at n=24A118632
- Expansion of x^2*(9 + 8*x - 8*x^2)/((1+x-x^2)*(1-2*x-4*x^2)).at n=7A121955
- Number of ways to place zero or more nonadjacent 0,0 1,0 2,0 2,1 3,1 4,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=6A155272
- Composite numbers n such that 8*n^2-2*n-1 divides the primitive part U(n) of Fibonacci(n).at n=13A159234
- Positive numbers n such that 8*n^2-2*n-1 divides Fibonacci(n).at n=40A159259
- The maximum possible number of rooted triples consistent with any galled-tree (level-1 phylogenetic network) containing exactly n leaves.at n=32A216499
- Composite numbers coprime to 6 such that A179382(n) = A000265(n-1), the odd part of n-1.at n=14A225913
- Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=19A229439
- Number of white square subarrays of (n+1)X(n+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=5A230982
- Number of white square subarrays of (n+1)X(6+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=5A230987
- T(n,k)=Number of white square subarrays of (n+1)X(k+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=60A230989
- 5*n^2 + 4*n - 15.at n=37A239794
- Number of partitions p of n such that median(p) = mean(p).at n=54A240219