4407
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6384
- Proper Divisor Sum (Aliquot Sum)
- 1977
- 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
- 2688
- Möbius Function
- -1
- Radical
- 4407
- 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
- 51
- 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
- One half of the number of permutations of [n] such that the differences have three runs with the same signs.at n=5A000352
- Coordination sequence T3 for Zeolite Code LTN.at n=46A008142
- Coordination sequence T2 for Zeolite Code NON.at n=40A008213
- Triangle T(n,k) = P(n,k)/2, n >= 2, 1 <= k < n, of one-half of number of permutations of 1..n such that the differences have k runs with the same signs.at n=30A008970
- a(n) = n*(13*n + 1)/2.at n=26A022271
- For n odd, >1, not divisible by 3, we can write 3/n = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest a.at n=36A027442
- For n != 1 mod 3, we can write 3/(2n+1) = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest such a, or 1 if n = 1 mod 3.at n=55A027443
- Coordination sequence T3 for Zeolite Code STT.at n=44A038426
- Base-6 palindromes that start with 3.at n=28A043012
- Numbers whose base-4 representation has exactly 7 runs.at n=23A043598
- Numbers k such that number of runs in the base 4 representation of k is congruent to 1 mod 6.at n=41A043838
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 7.at n=23A043843
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 8.at n=23A043857
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 9.at n=23A043865
- Numbers k such that the number of runs in the base-4 representation of k is congruent to 7 (mod 10).at n=23A043874
- For each prime p take the sum of nonprimes < p.at n=27A045717
- a(1) = 6; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=31A046256
- Composite numbers n such that sigma(n)+12 = sigma(n+12).at n=5A054902
- Split positive integers into extending even groups and sum: 1+2, 3+4+5+6, 7+8+9+10+11+12, 13+14+15+16+17+18+19+20, ...at n=13A061317
- Numbers k such that p=k^2+2 and p+2 are primes.at n=43A086381