4738
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7488
- Proper Divisor Sum (Aliquot Sum)
- 2750
- 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
- 2244
- Möbius Function
- -1
- Radical
- 4738
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 121
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Ménage numbers: a(0) = 1, a(1) = -1, and for n >= 2, a(n) = number of permutations s of [0, ..., n-1] such that s(i) != i and s(i) != i+1 (mod n) for all i.at n=8A000179
- Permanent of a certain cyclic n X n (0,1) matrix.at n=8A000805
- a(n) = 1 + Sum_{i=1..n} (n-i+1)*phi(i).at n=35A005598
- Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1.at n=33A008305
- Numbers k such that sigma(k) = sigma(k+5).at n=4A015865
- Coordination sequence T2 for Zeolite Code OSI.at n=45A016431
- Coordination sequence T3 for Zeolite Code OSI.at n=45A016432
- a(n+1) = a(n) converted to base 8 from base 3 (written in base 10).at n=4A023371
- T(2n,n+1), T given by A026758.at n=6A026872
- Numbers having three 4's in base 9.at n=29A043471
- Numbers whose base-4 representation contains exactly three 0's and three 2's.at n=17A045055
- 1/2-Smith numbers.at n=28A050224
- Triangle read by rows, giving coefficients of the ménage hit polynomials ordered by descending powers. T(n, k) for 0 <= k <= n.at n=44A058087
- Numbers k such that floor(Pi*k) is a square.at n=43A061812
- Length of period of the continued fraction expansion of sqrt(-1+n^n).at n=13A077098
- a(n) = floor(average of first n cubes).at n=25A078618
- a(n) = ((2n+1)*3^n - 1)/2.at n=5A079272
- Triangle read by rows: T(n,k) = number of ways of seating n couples around a circular table so that exactly k married couples are adjacent (0 <= k <= n).at n=36A094314
- Same as A000179, except that a(0) = 2.at n=8A102761
- Number of partitions of n into Fibonacci number of integer parts.at n=37A102848