8055
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14040
- Proper Divisor Sum (Aliquot Sum)
- 5985
- 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
- 4272
- Möbius Function
- 0
- Radical
- 2685
- Omega Function (Ω)
- 4
- 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
- 70
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that 71*2^k+1 is prime.at n=17A032385
- a(n) = n*(4*n-1).at n=45A033991
- Numbers whose base-4 representation contains exactly three 1's and four 3's.at n=10A045128
- Numbers n such that 229*2^n-1 is prime.at n=29A050866
- We have one bead labeled i for every i=1, 2, ...; a(n) = number of necklaces that can be made using any subset of the first n beads.at n=8A116723
- Odd composite numbers such that the sum of any two terms, plus 1, is composite.at n=35A133763
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, 0, 1), (0, 1, -1), (0, 1, 1), (1, -1, 1)}.at n=7A150510
- a(n) = 9*a(n-1) + 6*a(n-2); a(0)=0, a(1)=1.at n=5A153191
- Triangle T(n, k) = A143491(n+2, k+2) + A143491(n+2, n-k+2), read by rows.at n=22A155755
- Triangle T(n, k) = A143491(n+2, k+2) + A143491(n+2, n-k+2), read by rows.at n=26A155755
- a(n) = 4*n^2 + 79*n + 390.at n=34A157434
- Partial sums of A106116.at n=39A173112
- Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2.at n=44A180825
- a(n)=(A210686(n)-1)/30.at n=42A181903
- Number of -1..1 arrays of n elements with first, second and third differences also in -1..1.at n=20A202117
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^2>x^2+y^2.at n=25A211810
- Numbers n that divide the sum of digits of 36^n.at n=29A220364
- a(1)=a(2)=0; thereafter a(n) = a(n-2)+A238828(n-1)+A238827(n).at n=13A238830
- Number of partitions of n such that m(1) = m(3), where m = multiplicity.at n=43A240058
- Numbers k with the property that it is possible to write the base 2 expansion of k as concat(a_2,b_2), with a_2>0 and b_2>0 such that, converting a_2 and b_2 to base 10 as a and b, we have sigma(a + b) = sigma(k).at n=10A258843