6054
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
- 8
- Divisor Sum
- 12120
- Proper Divisor Sum (Aliquot Sum)
- 6066
- 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
- 2016
- Möbius Function
- -1
- Radical
- 6054
- 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
- 67
- Smith Number
- yes
- 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
- Number of 5th-order maximal independent sets in path graph.at n=49A007380
- a(n) = floor( n*(n-1)*(n-2)/26 ).at n=55A011908
- Number of ordered quadruples of integers from [ 1,n ] with no common factors between triples.at n=20A015635
- Numbers k such that Fibonacci(k) == 8 (mod k).at n=45A023177
- Expansion of log(1+log(1+x)^2)/2.at n=8A024329
- Number of partitions of n with equal number of parts congruent to each of 1 and 3 (mod 5).at n=43A035557
- Shifts left under transform T where Ta is (identity) DCONV a.at n=33A038046
- a(n) = Sum_{i=1..n} T(i,n-i), where T is A049615.at n=42A049616
- Numbers which are the sum of their proper divisors containing the digit 0.at n=24A059461
- a(1) = 1, a(n+1) is the sum of a(n) and ceiling( arithmetic mean of a(1) ... a(n) ).at n=30A065095
- Numbers k such that the number of distinct primes dividing k = number of anti-divisors of k.at n=37A073713
- Number of unimodal compositions of n+2 where the maximal part appears exactly twice.at n=23A114921
- Triangle read by rows: T(n,k) = number of permutations p of 1,...,n, with min(|p(i)-p(i-1)|, i=2..n) = k (n>=2, k>=1).at n=34A129534
- Values of n such that n^a-+a are primes, a=5.at n=5A155021
- A general recursion triangle with third part a power triangle:m=3; Power triangle: f(n,k,m)=If[n*k*(n - k) == 0, 1, n^m - (k^m + (n - k)^m)]; Recursion: A(n,k,m)=(m*(n - k) + 1)*A(n - 1, k - 1, m) + (m*k + 1)*A(n - 1, k, m) + m*f(n, k, m)*A(n - 2, k - 1, m).at n=12A157630
- Number of binary strings of length n with equal numbers of 00101 and 01010 substrings.at n=13A164245
- Numbers n such that n, n+1 and n+2 have the same number of divisors, and that number of divisors is larger than 4.at n=41A171666
- a(1) = 1, a( n) = prime(a(n-1)) + 5a(n-1).at n=4A179517
- Number of 3 X 3 0..n symmetric arrays with all rows summing to floor(n*3/2).at n=22A213801
- Triprimes (numbers that are a product of exactly three primes: A014612) that become cubes when their central digit or central pair of digits is deleted.at n=32A217297