8332
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 14588
- Proper Divisor Sum (Aliquot Sum)
- 6256
- 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
- 4164
- Möbius Function
- 0
- Radical
- 4166
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 127
- 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
- Number of partitions of n into 3 or more parts.at n=31A004250
- Representation degeneracies for Neveu-Schwarz strings.at n=23A005295
- a(n) = floor(n*(n-1)*(n-2)/30).at n=64A011912
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite DDR = Deca-dodecasil 3R[Si120O240]qR starting with a T5 atom.at n=12A019112
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 64 ones.at n=5A031832
- Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).at n=70A036865
- Number of different positive braids with n crossings of 4 strands.at n=11A054480
- Positive numbers whose product of digits is 9 times their sum.at n=26A062041
- Final members of groups in A076105.at n=42A076102
- Square spiral of sums of selected preceding terms, starting at 1 (a spiral Fibonacci-like sequence).at n=17A094767
- Molien series for group of order 4608 acting on joint weight enumerators of a pair of binary doubly-even self-dual codes.at n=38A097870
- Expansion of the solution of a functional equation.at n=13A112483
- Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231.at n=35A116721
- 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, 1), (-1, 0, 1), (0, -1, 1), (0, 1, 1), (1, 1, -1)}.at n=8A149016
- 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, 1), (-1, 0, 1), (0, 1, 0), (1, 0, 1), (1, 1, -1)}.at n=7A150296
- Triangular array read by rows. T(n,k) is the number of ternary length-n words in which the longest run of consecutive 0's is exactly k; n>=0, 0<=k<=n.at n=58A209240
- Triangle read by rows: T(n,k) = number of plateau polycubes of width n and volume k.at n=50A232483
- Expansion of -(x*(1-sqrt((2*(1-sqrt(4*x^2+1)))/x+1)))/(1-sqrt(4*x^2+1)) - 1.at n=10A243814
- Expansion of (x*sqrt(4*x^2+1)-x)/(x*sqrt(-(2*sqrt(4*x^2+1)-x-2)/x) + sqrt(4*x^2+1)-x-1).at n=11A243816
- Number of ON cells in the even-rule cellular automaton after n steps with the Moore neighborhood (8 neighbors), with minimal nontrivial symmetric initial state (0,0), (0,1), (1,0), and (1,1) ON.at n=94A254731