4907
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5616
- Proper Divisor Sum (Aliquot Sum)
- 709
- 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
- 4200
- Möbius Function
- 1
- Radical
- 4907
- 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
- 134
- 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) = round(1000*log_2(n)).at n=29A004266
- a(n) = ceiling(1000*log_2(n)).at n=29A004267
- Coordination sequence T2 for Zeolite Code MEL.at n=45A008151
- Coordination sequence T6 for Zeolite Code MEL.at n=45A008155
- Expansion of 1/((1-2x)(1-3x)(1-6x)(1-12x)).at n=3A025942
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 20.at n=6A031698
- Number of partitions of n with equal number of parts congruent to each of 1 and 2 (mod 5).at n=42A035556
- Positive numbers having the same set of digits in base 6 and base 8.at n=31A037435
- Sum of smallest parts of all partitions of n.at n=28A046746
- a(n) = Sum_{m=1..n, k=1..m} T(m,k), array T as in A049834.at n=32A049836
- a(n) = 100*n^2 + n.at n=6A055438
- Composite and every divisor (except 1) contains the digit 7.at n=21A062676
- Sum of primes p with n^2 < p < (n+1)^2.at n=25A108314
- a(n) = prime(n)_n.at n=48A122637
- a(n) = least k such that the remainder when 9^k is divided by k is n.at n=45A127817
- The second of the pair of consecutive integers k and k+1 such that sopfr(k) divides sopfr(k+1), where sopfr(k) is the sum of the prime factors of k, counting multiplicity.at n=42A129317
- 3n^3 - 2n^2 + n - 1.at n=11A130885
- Row sums of triangle A134237.at n=44A134238
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 0110-0110-1111 pattern in any orientation.at n=10A147359
- a(n) = 49*n^2 + 7.at n=9A158481