4031
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4200
- Proper Divisor Sum (Aliquot Sum)
- 169
- 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
- 3864
- Möbius Function
- 1
- Radical
- 4031
- 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
- 95
- 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
- Number of planar partitions of n decreasing across rows.at n=18A003293
- a(n) = (n + 3)*(n^2 + 6*n + 2)/6.at n=26A005286
- Numbers n such that 8*3^n + 1 is prime.at n=15A005538
- Coordination sequence T2 for Zeolite Code AEI.at n=48A008002
- Coordination sequence T1 for Zeolite Code MTT.at n=39A008189
- Coordination sequence T1 for Zeolite Code YUG.at n=41A008247
- Coordination sequence T2 for Zeolite Code RUT.at n=42A009898
- Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 7 (most significant digit on right and removing all least significant zeros before concatenation).at n=8A029524
- Multiplicity of highest weight (or singular) vectors associated with character chi_19 of Monster module.at n=35A034407
- Sums of 11 distinct powers of 2.at n=5A038462
- Irregular triangle read by rows: T(n,k) = number of orbits of order exactly k under doubling map which remain in a semicircle, with k dividing n.at n=56A038870
- Denominators of continued fraction convergents to sqrt(167).at n=6A041309
- a(n)=(s(n)+6)/10, where s(n)=n-th base 10 palindrome that starts with 4.at n=25A043083
- Numbers having three 7's in base 8.at n=13A043451
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m), where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n-1 <= 2^(p+1), starting with a(1) = a(2) = 1.at n=12A049941
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 24.at n=25A051989
- Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.at n=38A056219
- Birthday set of order 9: i.e., numbers congruent to +- 1 modulo 2, 3, 4, 5, 6, 7, 8 and 9.at n=25A057541
- Composite n such that sigma(n)-phi(n) divides sigma(n)+phi(n).at n=36A061367
- The least number k = a(n) > a(n-1) for which k!/(k+1)^m for increasing m's.at n=35A061769