3933
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 6240
- Proper Divisor Sum (Aliquot Sum)
- 2307
- 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
- 2376
- Möbius Function
- 0
- Radical
- 1311
- 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
- 144
- 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
- no
- Odd
- yes
Appears in sequences
- Maxima of the rows of the triangle A259095.at n=36A005577
- Number of directed column-convex polyominoes with perimeter 2n+2.at n=8A006027
- Coordination sequence T1 for Zeolite Code MTW.at n=41A008196
- Numbers having three 3's in base 10.at n=29A043503
- Numbers whose base-4 representation contains exactly three 1's and three 3's.at n=17A045127
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= n/3.at n=27A048000
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n-1)/3.at n=27A048013
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n+1)/3.at n=27A048046
- a(n) = Sum_{i=1..n} T(i,n-i), where T is A049615.at n=36A049616
- Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition.at n=19A057949
- Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition.at n=17A057950
- Another 3-way generalization of series-parallel networks with n labeled edges.at n=5A058562
- Number of primes below n^3 does not exceed n times the number of primes below n^2.at n=40A060304
- Numbers with all odd digits, in which each digit divides the number formed by the rest, i.e., the number obtained by just removing this digit.at n=31A061507
- Numbers with at least 2 distinct digits and whose "rotations" (including the number itself) are multiples of these digits; repeated digits allowed but digit 0 not allowed.at n=9A066484
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=24A078970
- Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).at n=13A085607
- a(n) is the least number of prime factors in any non-deficient number that has the n-th prime as its least prime factor.at n=41A107705
- a(n) is the least number of prime factors for any abundant number with p_n (the n-th prime) as its least factor.at n=41A108227
- Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^p) = p*(column p+3 of T), or [T^p](m,0) = p*T(p+m,p+3) for all m>=1 and p>=-3.at n=22A111544