3054
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6120
- Proper Divisor Sum (Aliquot Sum)
- 3066
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1016
- Möbius Function
- -1
- Radical
- 3054
- 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
- 154
- 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
- yes
- Odd
- no
Appears in sequences
- Nearest integer to 4 * Pi * n^3 / 3.at n=9A002101
- Numbers k such that Fibonacci(k) == 8 (mod k).at n=26A023177
- a(n) = position of 3*n^2 in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).at n=31A025056
- Sequence A025513 divided by 2.at n=18A025514
- Number of partitions of n into an odd number of parts, the least being 3; also, a(n+3) = number of partitions of n into an even number of parts, each >=3.at n=50A027189
- Multiplicity of highest weight (or singular) vectors associated with character chi_112 of Monster module.at n=35A034500
- Number of partitions of n into parts not of form 4k+2, 12k, 12k+3 or 12k-3.at n=50A036018
- Number of partitions of n such that cn(0,5) = cn(1,5) = cn(3,5) <= cn(2,5) = cn(4,5).at n=65A036866
- Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5).at n=68A036868
- Number of partitions of n such that cn(0,5) = cn(1,5) = cn(3,5) < cn(2,5) = cn(4,5).at n=65A036869
- Numbers k such that the string 6,3 occurs in the base 9 representation of k but not of k-1.at n=41A044308
- Numbers n such that string 5,4 occurs in the base 10 representation of n but not of n-1.at n=33A044386
- Numbers n such that string 5,4 occurs in the base 10 representation of n but not of n+1.at n=33A044767
- Numbers whose base-4 representation contains exactly three 2's and three 3's.at n=8A045151
- Becomes prime or 4 after exactly 7 iterations of f(x) = sum of prime factors of x.at n=34A048129
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049727.at n=31A049739
- Numbers k such that k and k+1 are modest (cf. A054986).at n=6A055018
- Number of 2-trees rooted at any symmetric edge.at n=14A063687
- Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2).at n=42A071943
- Number of connected circulant graphs on n nodes.at n=27A075545