6055
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8352
- Proper Divisor Sum (Aliquot Sum)
- 2297
- 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
- 4128
- Möbius Function
- -1
- Radical
- 6055
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 93
- 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
- Sum of the numbers between the two n's in A026362.at n=40A026365
- Number of n-node rooted unlabeled trees with out-degree <=2 and exactly 2 edges at the root.at n=15A036657
- Number of partitions satisfying cn(0,5) + cn(1,5) + cn(4,5) < cn(2,5) + cn(3,5).at n=36A039880
- Numbers k such that 80*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=18A056694
- a(n) = Sum_{d|n} phi(d^3).at n=21A068963
- Expansion of (1-x)/(1-3*x-2*x^2-3*x^3).at n=7A077838
- Consider recurrence b(0) = (2n+1)/4, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).at n=15A081851
- Sum of the first n primes whose indices are primes.at n=26A083186
- Numbers n such that p(12n) is prime, where p(n) is the number of partitions of n.at n=17A115214
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 5 and 6.at n=40A136888
- a(n) = (5*n-7)*(n-1).at n=35A147874
- Numbers k such that the two closest numbers above and below k, which are in A010784 and which have no common digit with k, have the same distance to k.at n=14A160343
- n-th single or isolated number*n-th non-single or nonisolated number.at n=28A167885
- G.f. A(x) satisfies A(x) = 1+x*A(x)+x^2*A(x)^2+2*x^3*A(x)^3.at n=9A186239
- Number of -3..3 arrays of n elements with first through fourth differences also in -3..3.at n=6A202659
- T(n,k)=Number of -k..k arrays of n elements with first through fourth differences also in -k..k.at n=42A202664
- Number of -n..n arrays of 7 elements with first through fourth differences also in -n..n.at n=2A202667
- Number of 2 X 2 matrices having all terms in {1,...,n} and determinant >= 2n.at n=11A211062
- a(n) is the sum of all distinct integers that can be produced by reversing the digits of n in any base b >= 2.at n=38A211518
- Number of partitions of 2^n into three distinct primes.at n=18A214844