8132
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 6988
- 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
- 3816
- Möbius Function
- 0
- Radical
- 4066
- 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
- 114
- 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
- yes
- Odd
- no
Appears in sequences
- Dimension of n-th compound of a certain space.at n=13A007182
- Expansion of 1/((1-x)(1-7x)(1-8x)(1-12x)).at n=3A024440
- (s(n)+2)/10, where s(n)=n-th base 10 palindrome that starts with 8.at n=35A043087
- Numbers k such that k and its reversal are both multiples of 19.at n=25A062907
- Non-palindromic number and its reversal are both multiples of 19.at n=16A062916
- a(n) = 8^n - 7^n - 6^n - 5^n + 3*4^n.at n=5A081687
- Coefficients in a certain Poincaré series [or Poincare series].at n=26A098705
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having abscissa of first return equal to 3k.at n=15A108439
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having height of last peak equal to k.at n=31A109158
- Number of alternating separable permutations.at n=10A121703
- Geodesic growth sequence for Richard Thompson's group F with the standard generating set x_0, x_1.at n=8A156946
- Number of nX2 array permutations with each element moved and moved by a city block distance of no more than three.at n=3A188963
- Number of nX4 array permutations with each element moved and moved by a city block distance of no more than three.at n=1A188965
- T(n,k)=Number of nXk array permutations with each element moved and moved by a city block distance of no more than three.at n=11A188966
- T(n,k)=Number of nXk array permutations with each element moved and moved by a city block distance of no more than three.at n=13A188966
- Number of right triangles on a (n+1) X 4 grid.at n=22A189808
- Number of 0..n arrays x(0..7) of 8 elements with zero 5th differences.at n=18A200275
- a(1) = 1; for n > 1, a(n) = smallest integer > a(n-1) such that a(n)*a(i)+1 is semiprime for all 1 <= i <= n-1.at n=8A219953
- Majority value maps: number of n X 2 binary arrays indicating the locations of corresponding elements equal to at least half of their king-move neighbors in a random 0..1 n X 2 array.at n=7A220213
- T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their king-move neighbors in a random 0..1 nXk array.at n=37A220217