7630
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 15840
- Proper Divisor Sum (Aliquot Sum)
- 8210
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2592
- Möbius Function
- 1
- Radical
- 7630
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 176
- 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
- yes
- Odd
- no
Appears in sequences
- Number of n-bead necklaces with beads of 2 colors and primitive period n, when turning over is allowed.at n=18A001371
- a(n) = T(3n,n), where T is the array in A026120.at n=5A026129
- a(n) = T(n,n-4), array T as in A055807.at n=31A055809
- Number of primitive (period n) bracelets using exactly two different colored beads.at n=17A056348
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 93 ).at n=32A063366
- Numbers k such that both k and the k-th prime have nonincreasing digits.at n=45A116067
- a(n) = Sum_{i=n..n+3} Sum_{j=i+1..n+4} prime(i)*prime(j).at n=7A127350
- 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), (-1, 1), (0, -1), (1, -1), (1, 0)}.at n=11A151506
- Partial sums of [A052938(n)^2].at n=41A162899
- a(n) = ceiling(A173497(n)/2).at n=30A173508
- Triangle T(n,k), read by rows, given by (0, 2, 3, 4, 6, 6, 9, 8, 12, 10, 15, ...) DELTA (1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...) where DELTA is the operator defined in A084938.at n=32A185285
- Number of right triangles on a (n+1)X6 grid.at n=11A189810
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = n + 5.at n=29A210377
- Number of (w,x,y) with all terms in {0,...,n} and |w-x|+|x-y|+|y-w| <= w+x+y.at n=21A213487
- Least integer b > F(n) such that sum_{k=1}^n F(k)*b^{k-1} is prime, where F = A000045.at n=18A224487
- Product of n and the sum of remainders of n mod k, for k = 1, 2, 3, ..., n.at n=34A256532
- Sum of the entries in the last blocks of all set partitions of [n].at n=6A285424
- Sum T(n,k) of the entries in the k-th last blocks of all set partitions of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=21A286232
- Take apart the sides of each of the integer-sided triangles with perimeter n (at their vertices) and rearrange them orthogonally in 3-space so that their endpoints coincide at a single point. a(n) is the total volume of all rectangular prisms enclosed in this way.at n=25A308233
- Primitive pseudoperfect numbers (A006036) that are not primitive abundant (A071395).at n=29A335290