4390
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7920
- Proper Divisor Sum (Aliquot Sum)
- 3530
- 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
- 1752
- Möbius Function
- -1
- Radical
- 4390
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T3 for Zeolite Code LIO.at n=46A008131
- Coordination sequence T2 for Zeolite Code LTN.at n=46A008141
- Coordination sequence T1 for Zeolite Code TON.at n=41A008241
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12).at n=39A017843
- Expansion of 1/(1-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15).at n=50A017864
- Numbers k such that the continued fraction for sqrt(k) has period 56.at n=14A020395
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=34A024843
- Number of ways to partition n elements into pie slices of different sizes.at n=28A032153
- Numbers whose set of base-11 digits is {1,3}.at n=28A032918
- Coefficients of completely replicable function 50a with a(0) = 1.at n=52A034320
- Coordination sequence T11 for Zeolite Code STT.at n=44A038429
- Numbers whose base-4 representation has exactly 7 runs.at n=13A043598
- Numbers k such that number of runs in the base 4 representation of k is congruent to 1 mod 6.at n=31A043838
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 7.at n=13A043843
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 8.at n=13A043857
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 9.at n=13A043865
- Numbers k such that the number of runs in the base-4 representation of k is congruent to 7 (mod 10).at n=13A043874
- a(n) = Sum_{k=1..floor((n+1)/2)} T(n,2k-1), array T as in A049777.at n=28A049778
- House numbers: a(n) = (n+1)^3 + Sum_{i=1..n} i^2.at n=14A051662
- a(n) = 4*n^2 - 7*n + 4.at n=33A054567