4717
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4860
- Proper Divisor Sum (Aliquot Sum)
- 143
- 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
- 4576
- Möbius Function
- 1
- Radical
- 4717
- 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
- 59
- 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
- Expansion of e.g.f. log(1 + x*cosh(x)).at n=7A009305
- a(n) = floor( n*(n-1)*(n-2)/22 ).at n=48A011904
- Number of triples (i,j,k) with 1 <= i < j < k <= n and gcd(i,j,k) = 1.at n=32A015616
- Numbers k such that the continued fraction for sqrt(k) has period 40.at n=41A020379
- Convolution of natural numbers with composite numbers.at n=23A023539
- Numbers having period-6 5-digitized sequences.at n=30A031190
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+3 or 20k-3. Also number of partitions in which no odd part is repeated, with 1 part of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=47A036025
- a(0)=1; a(1)=1; a(n)= a(n-1) + floor(sqrt(a(n-1)*a(n-2))) + floor(sqrt(a(n-3)*a(n-4))) + ....at n=14A043328
- Numbers whose base-5 representation contains exactly three 2's and two 3's.at n=12A045276
- A Diaconis-Mosteller approximation to the Birthday problem function.at n=24A050255
- Counterbalanced numbers: Composite numbers k such that phi(k)/(sigma(k)-k) is an integer.at n=9A055940
- Smallest composite number in base n which contains its largest proper factor as a substring.at n=13A063248
- Duplicate of A055940.at n=9A070158
- Smallest argument m such that commutator[phi(m), gpf(m)] = 2n-1, where phi(m) = A000010(m) and gpf(m) = A006530(m), the largest prime factor of m.at n=37A070818
- Numbers k such that the number of primes <= k is equal to the sum of primes from the smallest prime factor of k to the largest prime factor of k.at n=5A074210
- Numbers k such that 10^999 + k is a (titanic) prime.at n=5A074282
- Semiperimeter of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=8A089549
- Convolution of Pell(n) and 2^n.at n=9A094706
- a(n) = smallest M such that M is not divisible by prime(1), ..., prime(n), but is divisible by Sum_{i=1..n} (M mod prime(i)); or 0 if no such M exists.at n=12A106572
- Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n and having k double rises at an odd level (n >= 1, k >= 0).at n=38A121529