4403
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5472
- Proper Divisor Sum (Aliquot Sum)
- 1069
- 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
- 3456
- Möbius Function
- -1
- Radical
- 4403
- 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
- 139
- 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
- no
- Odd
- yes
Appears in sequences
- Powers of rooted tree enumerator.at n=13A000439
- Coordination sequence T4 for Zeolite Code LTN.at n=46A008143
- Coordination sequence T8 for Zeolite Code MFI.at n=42A008171
- Coordination sequence for Ni2In, Position Ni1 and In.at n=20A009941
- Positive integers n such that 2^n == 2^11 (mod n).at n=53A015935
- n written in fractional base 8/4.at n=51A024646
- Number of 5's in all partitions of n.at n=31A024789
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=28A025001
- Numbers whose set of base-11 digits is {3,4}.at n=16A032835
- Numbers whose set of base-16 digits is {1,3}.at n=17A032923
- Every run of digits of n in base 16 has length 2.at n=17A033014
- Numbers whose base-16 expansion has no run of digits with length < 2.at n=33A033029
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=44A036810
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=45A036816
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) <= cn(1,5) + cn(4,5) + cn(3,5).at n=29A039844
- Numbers whose base-4 representation has exactly 7 runs.at n=20A043598
- Numbers k such that number of runs in the base 4 representation of k is congruent to 1 mod 6.at n=38A043838
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 7.at n=20A043843
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 8.at n=20A043857
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 9.at n=20A043865