9332
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
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 16338
- Proper Divisor Sum (Aliquot Sum)
- 7006
- 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
- 4664
- Möbius Function
- 0
- Radical
- 4666
- 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
- 34
- 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
- Triangle T(n,k), n>=1, read by rows, where T(n,k) is the number of lattice polygons with area n and perimeter 2*k.at n=49A008855
- a(n) = floor( n*(n-1)*(n-2)/22 ).at n=60A011904
- a(n+1) = a(n) converted to base 6 from base 5 (written in base 10).at n=23A023379
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=31A025113
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 48.at n=41A031546
- Array A read by diagonals; n-th difference of (A(k,n), A(k,n-1),..., A(k,0)) is (k+2)^(n-1), for n=1,2,3,...; k=0,1,2,...at n=48A047848
- a(n) = A047848(3,n).at n=6A047851
- Numbers m such that [A070080(m), A070081(m), A070082(m)] is an acute scalene integer triangle with prime side lengths.at n=24A070123
- Indices of triple-safe primes: p=prime(n) is double-safe: q=(p-1)/2, r=(q-1)/2 and s=(r-1)/2 are all prime (and q is double-safe).at n=14A075134
- Numbers k such that 7*10^k + 3*R_k + 6 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=11A103056
- Triangle whose k-th column satisfies a(n) = (k+3)*a(n-1)-(k+2)*a(n-2).at n=59A123490
- a(n) = 2*L(n) + L(n-1) - n, L(n) = n-th Lucas number A000204(n).at n=16A133641
- 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, 0), (1, 0, -1), (1, 0, 1), (1, 1, 0)}.at n=7A150722
- Number of strings of numbers x(i=1..n) in 0..3 with sum i*x(i) equal to n*3.at n=13A184697
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210865; see the Formula section.at n=48A210864
- Numbers n such that if n = a U b (where U denotes concatenation) then abs(sigma*(a) - sigma*(b)) = abs(sigma*(n) - n), where sigma*(n) is the sum of the anti-divisors of n.at n=8A239687
- Number of partitions of n with difference -8 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=36A242684
- Number of (n+2)X(2+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101.at n=8A260835
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 361", based on the 5-celled von Neumann neighborhood.at n=23A271416
- Number of little cubes visible around an n X n X n cube with a face on a table.at n=43A273982