4737
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6320
- Proper Divisor Sum (Aliquot Sum)
- 1583
- 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
- 3156
- Möbius Function
- 1
- Radical
- 4737
- 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
- Number of partitions of n into Fibonacci parts (with a single type of 1).at n=53A003107
- Coordination sequence T3 for Zeolite Code TER.at n=46A016435
- a(n) = [ Sum{(sqrt(j+1)-sqrt(i+1))^2} ], 1 <= i < j <= n.at n=44A025222
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 44.at n=39A031542
- Numbers k such that 35*2^k+1 is prime.at n=20A032367
- Numerators of partial sums of Bernoulli numbers B_{2n} = A000367/A002445.at n=6A035078
- Base-6 palindromes that start with 3.at n=37A043012
- Numbers having four 2's in base 5.at n=35A043360
- Numbers having four 3's in base 6.at n=20A043384
- Coordination sequence T4 for Zeolite Code MTF.at n=41A057307
- E.g.f.: exp(x*exp(x) + 1/3*x^3*exp(x)^3).at n=6A060906
- a(n) = floor(e^n / n^e).at n=15A062277
- a(n) = 2^n + 5^n + 8^n.at n=4A074539
- Number of iterations used by a 2D cutting stock problem related algorithm.at n=3A090380
- a(n) = Sum_{k=0..floor(n/3)} C(n-k,2*k) * 4^(n-3*k).at n=6A099781
- a(n) = Sum_{i=1..n} (n-i+1)*phi(i).at n=35A103116
- a(n) is the number of distinct n-th powers of functions {1, 2, 3, 4, 5, 6} -> {1, 2, 3, 4, 5, 6}.at n=20A103950
- Number of partitions of n in which each part, with the possible exception of the largest, occurs at least three times.at n=46A116932
- Cascadence of (1+x)^3; a triangle, read by rows of 3n+1 terms, that retains its original form upon convolving each row with [1,3,3,1] and then letting excess terms spill over from each row into the initial positions of the next row such that only 3n+1 terms remain in row n for n>=0.at n=41A120919
- a(n) = c is least number such that 10^n/2 -/+ c are primes.at n=34A124049