8331
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11112
- Proper Divisor Sum (Aliquot Sum)
- 2781
- 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
- 5552
- Möbius Function
- 1
- Radical
- 8331
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 66.at n=41A020405
- Expansion of (1+x^2-x^3)/(1-x)^4.at n=34A027378
- 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 91.at n=4A031589
- Lucky numbers with size of gaps equal to 16 (lower terms).at n=25A031898
- a(n) = T(2n-1,n), array T given by A048201.at n=45A048208
- Centered 14-gonal numbers.at n=34A069127
- a(n) = A026905(n) - A014284(n).at n=24A086741
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=33A098936
- Number of triples (i,j,k) with 1 <= i <= j < k <= n and gcd{i,j,k} = 1.at n=38A100448
- Number of partitions of n into parts but with two kinds of parts of sizes 1 to 10.at n=17A103929
- Sum of the primes in ordered 3 X 3 prime squares.at n=17A105089
- Set m = 0, n = 1. Find smallest k >= 2 such that pi(k) = (k-pi(k)) - (m-pi(m)); set a(n) = pi(k), m = k, n = n+1. Repeat.at n=44A131872
- Indices k such that A020507(k)=Phi[k](-8) is prime, where Phi is a cyclotomic polynomial.at n=28A138922
- Number of right triangles with nonnegative integer coordinates less than or equal to n and one corner at the origin.at n=39A155154
- Numbers n such that 2^x + 3^y is never prime when max(x,y) = n.at n=13A159625
- Triangular array read by rows. T(n,k) is the number of partitions of n (using 1 type of part 1, 2 types of part 2, ..., i types of part i, ...) that have exactly k distinct parts.at n=63A216221
- Numbers n such that n^2 + 1 and (n+1)^2 + 1 are divisible by a square.at n=35A217798
- T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=57A241435
- Number of 3 X n 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=8A241437
- Number T(n,k) of partitions of n into parts of exactly k sorts which are introduced in ascending order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=50A256130