4043
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
- 4
- Divisor Sum
- 4368
- Proper Divisor Sum (Aliquot Sum)
- 325
- 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
- 3720
- Möbius Function
- 1
- Radical
- 4043
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 25
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- a(n) = solution to the postage stamp problem with 3 denominations and n stamps.at n=38A001208
- Apply partial sum operator thrice to Fibonacci numbers.at n=13A014162
- Composite n such that phi(n) * sigma(n) is one less than a square.at n=25A015709
- Odd composite n such that phi(n) * sigma(n) is one less than a square.at n=9A015722
- n written in fractional base 8/4.at n=43A024646
- Coordination sequence T8 for Zeolite Code MWW.at n=42A024993
- a(n) = Sum_{k=0..n+2} (k+1) * A026323(n, k).at n=6A027312
- a(n) = T(2n+1, n+2), T given by A027935.at n=6A027942
- Concatenation of n and n + 3.at n=39A032608
- a(n) = Sum_{k=0..n} (k+1) * Sum_{j=0..n} 2^j*binomial(n,j)*binomial(n-k,j).at n=5A035029
- Numbers whose base-5 representation contains exactly three 1's and two 3's.at n=28A045246
- Duplicate of A035029.at n=6A049607
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 16.at n=37A051981
- Convolution of A055853 with A011782.at n=6A055854
- Numbers k such that k | 12^k + 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.at n=41A057291
- Index of the first occurrence of prime(n) in A060324.at n=34A078454
- Indices of prime NSW numbers A088165.at n=15A113501
- a(n) = ceiling(Sum_{i=1..n-1} a(i)/4) for n >= 2 starting with a(1) = 1.at n=40A120160
- Expansion of 1/(x^5 - 2*x^4 + x^3 - 2*x^2 + x - 1).at n=38A129704
- Number of graphs with 2n vertices that have an odd determinant for their adjacency matrix.at n=3A141040