7648
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 7472
- 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
- 3808
- Möbius Function
- 0
- Radical
- 478
- Omega Function (Ω)
- 6
- 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
- 57
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- T(2n-1,n), array T as in A054144.at n=5A054149
- Surround numbers of an n X 1 rectangle.at n=8A060633
- Numbers k such that phi(x) = k has exactly 12 solutions.at n=27A060675
- Number of different values obtained by evaluating all different parenthesizations of 1/2/3/4/.../n.at n=16A078389
- Expansion of (1-4x+x^2)/((1-x)(1-3x)(1-4x)).at n=7A085280
- Cascadence of (1+2x)^2; a triangle, read by rows of 2n+1 terms, that retains its original form upon convolving each row with [1,4,4] and then letting excess terms spill over from each row into the initial positions of the next row such that only 2n+1 terms remain in row n for n>=0.at n=31A120914
- a(n) = prime(n^2) - n^2.at n=32A141129
- Coefficients in the expansion of C^7/B^8, in Watson's notation of page 106.at n=6A160521
- Numbers m such that m and m+22 have the same sum of divisors.at n=31A172333
- The non-common part of the smaller number of an amicable pair.at n=15A180326
- Monotonic ordering of nonnegative differences 6^i-2^j, for 40>=i>=0, j>=0.at n=33A192117
- Monotonic ordering of set S generated by these rules: if x and y are in S and x^2-y^2>0 then x^2-y^2 is in S, and 2 and 3 are in S.at n=14A192648
- Number of (n+1)X2 0..6 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=1A205039
- Number of (n+1)X3 0..6 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=0A205040
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=1A205046
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=2A205046
- Riordan array (f(x), x*g(x)) where f(x) is the g.f. of A157004 and g(x) is the g.f. of A157003.at n=47A213221
- Exponents m such that the decimal expansion of 3^m exhibits its first zero from the right later than any previous exponent.at n=20A239008
- 9-step Fibonacci sequence starting with 0,0,0,1,0,0,0,0,0.at n=22A251750
- T(n,k)=Number of nXk nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 1 and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=58A252889