4028
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 7560
- Proper Divisor Sum (Aliquot Sum)
- 3532
- 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
- 1872
- Möbius Function
- 0
- Radical
- 2014
- Omega Function (Ω)
- 4
- 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
- 95
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Sum of the first n primes.at n=45A007504
- Coordination sequence T3 for Zeolite Code MEI.at n=46A008148
- Coordination sequence T2 for Zeolite Code MTT.at n=39A008190
- Coordination sequence T1 for Zeolite Code VSV.at n=41A009914
- Coordination sequence T1 for Zeolite Code TER.at n=43A016433
- a(n) = Sum{T(i,j)}, 0<=j<=i, 0<=i<=n, T given by A026552.at n=9A026566
- a(n) = Sum_{k=0..floor(n/2)} T(n,k), T given by A026769.at n=11A026777
- "DHK" (bracelet, identity, unlabeled) transform of 2,1,1,1,...at n=12A032252
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 5).at n=40A035563
- a(n) = (8*(2^n) - n^2 - 3*n - 6)/2.at n=10A048492
- Truncated triangular pyramid numbers: a(n) = (n-5)*(n^2 + 8*n - 66)/6.at n=23A051939
- Composite numbers arising as sum of first k primes.at n=38A053790
- Smallest k such that k = n*A001414(k) (or 0 if no such k exists), where A001414(k) is the integer log of k, i.e., Sum p_i*e_i if the prime factorization of k is Product p_i^e_i.at n=52A067566
- Intersection of A068017 and A068019: numbers n such that both sigma(n) and phi(n) are middle terms between (different) twin prime pairs.at n=42A071348
- a(1) = 0; a(n) = smallest composite number which is a sum of n distinct primes.at n=44A073619
- Final terms of rows in A077339.at n=39A077340
- Numbers k such that A000984(k) mod k = 0 and A080383(k) != 7.at n=11A080392
- Numbers m that divide binomial(m*(m+1), m+1)/m^2.at n=24A082529
- Sum of the first 2n+1 primes.at n=22A109723
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDD's starting at level 0; here U=(1,1), D=(1,-1) (0<=k<=floor(n/2)).at n=52A114486