6095
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7776
- Proper Divisor Sum (Aliquot Sum)
- 1681
- 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
- 4576
- Möbius Function
- -1
- Radical
- 6095
- Omega Function (Ω)
- 3
- 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
- 62
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Rhombic dodecahedral numbers: a(n) = n^4 - (n - 1)^4.at n=11A005917
- a(n) = n*(n^2 + 1)/2.at n=23A006003
- a(n) = floor(n*(n - 1)*(n - 2)/32).at n=59A011914
- a(n) = 12^n - 11^n.at n=4A016197
- Numbers whose sum of divisors is a fifth power.at n=17A019423
- Pseudoprimes to base 54.at n=25A020182
- a(n) = n*(23*n + 1)/2.at n=23A022281
- Number of partitions of n in which the least part is 3.at n=51A026796
- Numbers whose base-4 representation contains exactly two 1's and four 3's.at n=24A045123
- Honaker's triangle problem: form a triangle with base of length n, all entries different, all row sums equal; a(n) gives minimal row sum.at n=33A047837
- a(n) = max_{r=1..n-1} ceiling(t(t(n)-t(r-1))/(n-r+1)), where t() = triangular numbers A000217.at n=33A047873
- Integers whose sum of divisors is 6^5 = 7776.at n=12A048255
- Numbers n such that n^2 contains exactly 8 different digits.at n=36A054036
- Nonnegative numbers of form n*(n^2+-1)/2.at n=45A057587
- McKay-Thompson series of class 26B for Monster.at n=26A058597
- Sum of the elements in any transversal of a prime(n) X prime(n) array containing the numbers from 1 to prime(n)^2 in standard order.at n=8A066886
- The terms of A073215 (sums of two powers of 23) divided by 2.at n=7A072822
- Row sums of triangle A074135.at n=22A074132
- Sum of terms in each group in A074147.at n=22A074149
- Let r be the matrix {{1,1},{0,1}} and b={{1,0},{1,0}}. Let A be the semigroup generated by r and b. a(n) is the number of words of length n in A.at n=32A121946