4607
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4896
- Proper Divisor Sum (Aliquot Sum)
- 289
- 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
- 4320
- Möbius Function
- 1
- Radical
- 4607
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 152
- 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
- Woodall (or Riesel) numbers: n*2^n - 1.at n=8A003261
- Twelve iterations of Reverse and Add are needed to reach a palindrome.at n=28A015993
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=25A024844
- Every run of digits of n in base 16 has length 2.at n=29A033014
- Multiplicity of highest weight (or singular) vectors associated with character chi_25 of Monster module.at n=36A034413
- Numerators of continued fraction convergents to sqrt(47).at n=7A041080
- Numerators of continued fraction convergents to sqrt(188).at n=7A041348
- Numerators of continued fraction convergents to sqrt(423).at n=7A041804
- Numerators of continued fraction convergents to sqrt(752).at n=7A042448
- Numbers having three 7's in base 8.at n=28A043451
- Positive integers having more base-16 runs of even length than odd.at n=30A044842
- Numbers whose base-4 representation contains exactly two 1's and four 3's.at n=15A045123
- Squarefree nonprimes with property that the concatenation of the prime factors is a palindrome.at n=38A046448
- Semiprimes whose prime factors, when concatenated, yield a palindrome.at n=35A046451
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x.at n=23A050788
- Expansion of (1+x^2-x^3)/((1-x)*(1-2*x)).at n=11A052996
- Triangular array generated by its row sums: T(n,0)=1 for n >= 0, T(1,1)=2, T(n,k)=T(n,k-1)+d*r(n-k) for k=2,3,...,n, d=(-1)^(k+1), n >= 2, r(h)=sum of the numbers in row h of T.at n=43A054098
- T(n,n-1), array T as in A054098.at n=7A054101
- 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=19A055468
- a(n) = 2*n^2 - 1.at n=48A056220