6072
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 11208
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1760
- Möbius Function
- 0
- Radical
- 1518
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 62
- 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
- Orders of noncyclic simple groups (without repetition).at n=12A001034
- Index of (the image of) the modular group Gamma(n) in PSL_2(Z).at n=22A001766
- a(n) = floor(n*(n-1)*(n-2)/15).at n=46A011897
- Population of "Triangle" cellular automaton at n-th generation.at n=35A018189
- a(n) = n*(23*n - 1)/2.at n=23A022280
- a(n) = n*(n+1)*(n+2)/2.at n=22A027480
- Shortest edge c of (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=27A031175
- a(n) = lcm(n,n+1,n+2).at n=21A033931
- Number of partitions satisfying cn(0,5) < cn(1,5) + cn(2,5) + cn(3,5) and cn(0,5) < cn(4,5) + cn(2,5) + cn(3,5).at n=30A039847
- Numerators of continued fraction convergents to sqrt(265).at n=8A041496
- a(n) = A004034(n)/16.at n=2A045824
- a(n) = lcm(n, phi(n), n - phi(n)).at n=45A052100
- Numbers which, when expressed as a sum of distinct primes with maximum product, use a non-maximal number of primes.at n=26A053020
- Coefficients of the '3rd-order' mock theta function omega(q).at n=43A053253
- Nonnegative numbers of form n*(n^2+-1)/2.at n=44A057587
- Smallest number m such that m^2+1 is divisible by A002144(n)^2 (= squares of primes congruent to 1 mod 4).at n=34A059321
- Orders of finite perfect groups (groups such that G = G' where G' is the commutator subgroup of G).at n=32A060793
- a(n) = lcm(3n+1, 3n+2, 3n+3).at n=7A061495
- a(n) = 12*n*(n-1).at n=23A064200
- a(n) = binomial(2*n,n) mod ((n+1)*(n+2)*(n+3)).at n=20A065345