4427
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4680
- Proper Divisor Sum (Aliquot Sum)
- 253
- 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
- 4176
- Möbius Function
- 1
- Radical
- 4427
- 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
- 95
- 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) = floor(Fibonacci(n)/4).at n=22A004697
- Coordination sequence T4 for Zeolite Code MFI.at n=42A008167
- Twelve iterations of Reverse and Add are needed to reach a palindrome.at n=26A015993
- Coordination sequence T1 for Zeolite Code CZP.at n=43A019456
- Fibonacci sequence beginning 0, 19.at n=13A022353
- Number of 8's in all partitions of n.at n=35A024792
- a(n) = (d(n)-r(n))/2, where d = A026063 and r is the periodic sequence with fundamental period (1,1,0,1).at n=27A026064
- Coordination sequence T3 for Zeolite Code CFI.at n=44A033601
- Number of partitions of n into parts not of the form 21k, 21k+9 or 21k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=29A035987
- 5x - 1 sequence starting at 19 (a(n+1) = a(n)/2 if a(n) is even, or 5*a(n)-1 if a(n) is odd).at n=22A037238
- Number of partitions satisfying cn(1,5) <= cn(0,5) and cn(4,5) <= cn(0,5).at n=38A039862
- Numbers whose base-5 representation contains exactly two 0's and three 2's.at n=11A045183
- a(n) = (F(6*n+4) - 3)/4, where F=A000045 (the Fibonacci sequence).at n=3A049665
- a(n) = a(n-3) + a(n-5) with initial values 1,0,0,1,0.at n=55A052920
- Number of primitive (period n) n-bead necklace structures using a maximum of four different colored beads.at n=9A056300
- Numbers k such that 2*5^k + 3 is prime.at n=15A057914
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 5.at n=38A064903
- Numbers which need 12 'Reverse and Add' steps to reach a palindrome.at n=26A065217
- Numbers that in base 2 need twelve 'Reverse and Add' steps to reach a palindrome.at n=38A066133
- Sum of terms of n-th group in A075383.at n=18A075386