8270
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14904
- Proper Divisor Sum (Aliquot Sum)
- 6634
- 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
- 3304
- Möbius Function
- -1
- Radical
- 8270
- 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
- 96
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite SGT = Sigma-2 [Si64O128].4R starting with a T4 atom.at n=12A019238
- a(n) = Sum_{k=1..n} (n-k) * floor(n/k).at n=49A024920
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 4.at n=15A049931
- Positions of check bits in code in A075934.at n=41A075936
- Triangular array formed by the little Schröder numbers s(n,k).at n=40A110440
- Triangle read by rows: T(n,k) is the number of partitions of binomial(n,k) into parts of the first n rows of Pascal's triangle, 0<=k<=n.at n=47A132311
- Triangle read by rows: T(n,k) is the number of partitions of binomial(n,k) into parts of the first n rows of Pascal's triangle, 0<=k<=n.at n=52A132311
- Number of trivially fully gated graphs on n nodes.at n=8A142860
- Number of ways to place zero or more nonadjacent 1,1 2,1 3,0 3,1 4,1 4,2 5,1 6,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=8A155383
- Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n.at n=90A181664
- Number of (w,x,y,z) with all terms in {1,...,n} and |w-x| <= |x-y| + |y-z|.at n=10A212572
- G.f.: 1/(1 - x*(1-x^6)/(1 - x^2*(1-x^7)/(1 - x^3*(1-x^8)/(1 - x^4*(1-x^9)/(1 - x^5*(1-x^10)/(1 - ...)))))), a continued fraction.at n=19A227375
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=24A229467
- Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly four solutions.at n=28A230856
- Central terms of triangle A110440.at n=4A232246
- Triangle read by rows: T(n,k), n>=1, k>=1, in which column k lists the numbers of A210843 multiplied by A000330(k), and the first element of column k is in row A000217(k).at n=25A249120
- Number of length 3 1..(n+2) arrays with no leading partial sum equal to a prime.at n=25A254541
- Numbers k such that 4^k + 27 is prime.at n=22A262969
- Number of n X 4 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=3A286975
- T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=24A286979