8271
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
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11960
- Proper Divisor Sum (Aliquot Sum)
- 3689
- 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
- 5508
- Möbius Function
- 0
- Radical
- 2757
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 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
- Cubes written backwards.at n=11A004165
- Number of T-frame polyominoes with n cells.at n=49A028247
- Numbers k such that 261*2^k+1 is prime.at n=49A032507
- Number of partitions of n into parts not of the form 25k, 25k+9 or 25k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=33A036008
- Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(1,5) + cn(4,5) + cn(3,5).at n=32A039902
- Interprimes which are of the form s*prime, s=9.at n=22A075284
- Number of rooted 2-dimensional polyominoes with n triangular cells, with no symmetries removed.at n=8A094164
- Array read by antidiagonals: T(n,k) = number of rooted 2-dimensional polyominoes with k cells, the cells being regular n-gons, with no symmetries removed.at n=44A094166
- Number of partitions of n with a product greater than n.at n=32A114324
- a(n) = c is least number such that 10^n/2 -/+ c are primes.at n=42A124049
- Number of different values of i^2+j^2+k^2+l^2+m^2+n^2 for i,j,k,l,m,n in [0,n].at n=39A132438
- Number of (w,x,y,z) with all terms in {1,...,n} and w >= (geometric mean of x,y,z).at n=11A212142
- Number of partitions p of n containing ceiling((min(p) + max(p))/2) as a part.at n=37A238484
- Odd numbers k such that A098548(k) is not a multiple of 3.at n=30A251540
- Let p = n-th prime == 7 mod 8; a(n) = sum of quadratic nonresidues mod p that are > p/2.at n=11A282042
- Number T(n,k) of entries in the k-th last blocks of all set partitions of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=29A286416
- Number of entries in the second last blocks of all set partitions of [n].at n=6A286433
- Number of n X n 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 1 or 3 1's.at n=3A295246
- Number of nX4 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 1 or 3 1s.at n=3A295249
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 1 or 3 1s.at n=24A295253