9904
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
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 19220
- Proper Divisor Sum (Aliquot Sum)
- 9316
- 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
- 4944
- Möbius Function
- 0
- Radical
- 1238
- Omega Function (Ω)
- 5
- 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
- 135
- 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 overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined.at n=21A015128
- Fibonacci sequence beginning 2, 15.at n=15A022117
- Number of partitions of n into 6 unordered relatively prime parts.at n=51A023026
- Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 2, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also sum of numbers in row n+1 of the array T in A026148.at n=9A026165
- Let m = 3, 5, 7, ..., k = 0, 1, 2, 3, ..., z = (m+1)/2, 0 < j <= m. Let n_j be a prime number. Sequence gives T(m,k) = Table[m,k] = number of solutions to Sum_{d=1,2, ..., (z+k)}(n_j)_d = Sum_{d=1,2, ..., (z-k-1)}(n_j)_d = primorial number (A002110).at n=68A057611
- Treated as strings, n begins with Floor(sqrt(n)).at n=27A069086
- Interprimes which are of the form s*prime, s=16.at n=10A075291
- Expansion of 1 / Product_{n>=0} (1 - q^(5n+1))*(1 - q^(5n+2))*(1 - q^(5n+4)).at n=47A107235
- Sieve performed by successive iterations of steps where step m is: keep m terms, remove the next 2 and repeat; as m = 1,2,3,.. the remaining terms form this sequence.at n=29A112560
- Number of degree-n permutations without even cycles and such that number of cycles of size 2k-1 is odd (or zero) for every k.at n=8A130648
- Record indices of the ratio A002375(n) / n (Goldbach conjecture related).at n=37A137820
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 0), (0, -1), (1, 1)}.at n=13A151377
- a(n) = |A001349(n) - A004251(n)|.at n=8A182179
- a(n) = the largest n-digit number with exactly 10 divisors, a(n) = 0 if no such number exists.at n=3A182680
- a(n) = the largest 4-digit number with exactly n divisors, a(n) = 0 if no such number exists.at n=9A182696
- Number of arrangements of n+1 nonzero numbers x(i) in -5..5 with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.at n=3A190067
- T(n,k)=Number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.at n=31A190071
- Number of arrangements of 5 nonzero numbers x(i) in -n..n with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.at n=4A190074
- Number of n-bead necklaces labeled with numbers -2..2 allowing reversal, with sum zero and first differences in -2..2.at n=10A209026
- Smallest k such that A002522(k) and A002522(k+2n) are successive primes of the form m^2+1.at n=25A245463