6972
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 18816
- Proper Divisor Sum (Aliquot Sum)
- 11844
- 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
- 1968
- Möbius Function
- 0
- Radical
- 3486
- Omega Function (Ω)
- 5
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 181
- 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
- a(n) = 2*n*(2*n-1).at n=42A002939
- Expansion of sin(log(1+x))/cos(x).at n=8A009459
- Pisot sequence E(8,10), a(n) = floor( a(n-1)^2/a(n-2) + 1/2 ).at n=27A010916
- Expansion of Product_{m>=1} (1 + m*q^m)^16.at n=4A022644
- a(n) = (-1 + prime(n+1)^2)/4.at n=37A024701
- Product of a prime and the following number.at n=22A036690
- Number of primes between n*100000 and (n+1)*100000.at n=15A038825
- Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.at n=51A049020
- a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^2.at n=41A053818
- Number of n-piece positions at checkers, for n=1 ... 24.at n=1A055213
- Take the first 2n integers and using each integer once and only once as either a numerator or a denominator, construct n fractions whose sum is an integer; a(n) = number of distinct solutions for n.at n=6A060146
- Triangle T(n,k) = binomial(n+2,k+1)*(binomial(n+2,k+1)-1), n >=0, 0 <= k <= n.at n=30A065420
- Triangle T(n,k) = binomial(n+2,k+1)*(binomial(n+2,k+1)-1), n >=0, 0 <= k <= n.at n=33A065420
- Sum of numbers in n-th upward diagonal of triangle in A079823.at n=35A079824
- Numbers k such that the largest prime power factor of k equals floor(sqrt(k)).at n=35A081807
- Maximal number of segments (equivalently, corners) in a rook circuit of a 2n X 2n board.at n=42A085622
- Largest achievable determinant of a 3 X 3 matrix whose elements are 9 distinct nonnegative integers chosen from the range 0..n.at n=10A097401
- Array read by antidiagonals: T(n,k) = variant of Knuth's Fibonacci (or circle) product of n and k (A101330).at n=48A101385
- a(n) = 4*n*(4*n - 1).at n=21A104188
- Matrix cube of triangle A105540 and, in this flattened form as read by rows, also equals column 2 of A105540.at n=46A105545