4011
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6144
- Proper Divisor Sum (Aliquot Sum)
- 2133
- 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
- 2280
- Möbius Function
- -1
- Radical
- 4011
- 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
- 188
- 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
- Coordination sequence T4 for Zeolite Code MEI.at n=46A008149
- Number of partitions of n into at most 7 parts.at n=36A008636
- Coordination sequence for sigma-CrFe, Position Xa.at n=16A009962
- Number of partitions of n into 7 unordered relatively prime parts.at n=36A023027
- Number of 6's in all partitions of n.at n=32A024790
- Number of partitions of n in which the greatest part is 7.at n=43A026813
- a(n) = T(n,n+3), T given by A027023.at n=9A027025
- a(n) = T(n,2n-9), T given by A027023.at n=7A027033
- Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 5).at n=38A035559
- Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(0,5) < cn(2,5) = cn(3,5).at n=10A036885
- a(n)=(s(n)+6)/10, where s(n)=n-th base 10 palindrome that starts with 4.at n=23A043083
- Numbers whose base-4 representation contains exactly three 2's and three 3's.at n=16A045151
- Numbers whose base-5 representation contains exactly three 1's and two 2's.at n=29A045231
- Numbers of the form p*q*r where p,q,r are (not necessarily distinct) odd palindromic primes (odd terms from A002385).at n=43A046373
- Numbers of the form p*q*r where p,q,r are distinct odd palindromic primes (odd terms from A002385).at n=15A046405
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049747.at n=46A049749
- 21-gonal numbers: a(n) = n*(19n - 17)/2.at n=21A051873
- Positions in decimal expansion of Pi where next prime begins.at n=26A053013
- Number of diagonal polyominoes with n cells.at n=8A056841
- The n-th n-gonal number: a(n) = n*(n^2 - 3*n + 4)/2.at n=21A060354