8266
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12402
- Proper Divisor Sum (Aliquot Sum)
- 4136
- 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
- 4132
- Möbius Function
- 1
- Radical
- 8266
- Omega Function (Ω)
- 2
- 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
- 158
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Expansion of 1/((1-x)^2*Product_{k>=1} (1-x^k)).at n=19A014153
- Numbers k such that the continued fraction for sqrt(k) has period 33.at n=23A020372
- Numbers which, when expressed as a sum of distinct primes with maximum product, use a non-maximal number of primes.at n=35A053020
- Centered 19-gonal numbers.at n=29A069132
- Number of primes with number of 0-bits <= number of 1-bits (A095074) in range ]2^n,2^(n+1)].at n=16A095054
- Number of A095316-primes in range [2^n,2^(n+1)].at n=16A095326
- Number of tilings of a 3 X n rectangle with n trominoes.at n=10A134438
- Number of n X n arrays of squares of integers summing to 6 with every element equal to at least one neighbor.at n=3A146197
- 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, -1, 0), (-1, 0, -1), (1, -1, -1), (1, 1, 1)}.at n=9A149078
- Cubes (n * n * n) in carryless arithmetic mod 10.at n=26A169885
- Semiprimes that are the sum of 10 consecutive primes.at n=12A185347
- Number of n X 4 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=7A207678
- Number of (w,x,y,z) with all terms in {0,...,n} and |w-x|+|x-y+|y-z|=2n.at n=43A212905
- a(n) = Sum_{i=0..n} digsum_5(i)^4, where digsum_5(i) = A053824(i).at n=19A231671
- a(n) = Sum_{i=0..n} digsum_6(i)^4, where digsum_6(i) = A053827(i).at n=19A231675
- Square roots of numbers in A238334.at n=40A238335
- Number of partitions p of n such that mean(p) < multiplicity(max(p)).at n=54A240200
- Number of partitions of n such that neither the number of parts having multiplicity >1 nor the number of distinct parts is a part.at n=41A241412
- Number of (n+2)X(4+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 2 and no column sum 2.at n=17A255224
- Numbers n such that the decimal expansions of both n and n^2 have 2 as smallest digit and 8 as largest digit.at n=22A257368