9885
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15840
- Proper Divisor Sum (Aliquot Sum)
- 5955
- 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
- 5264
- Möbius Function
- -1
- Radical
- 9885
- Omega Function (Ω)
- 3
- 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
- 135
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- MacMahon's generalized sum of divisors function.at n=19A002128
- Record subsequence of b(3k+2), b()=A048142().at n=31A051058
- Interprimes which are of the form s*prime, s=15.at n=35A075290
- a(n) = Sum_{k=0..n} (-1)^(n-k)*A000041(k).at n=36A087787
- For a given unrestricted partition pi, let P(pi)=lambda(pi), if mu(pi)=0. If mu(pi)>0 then let P(pi)=nu(pi), where nu(pi) is the number of parts of pi greater than mu(pi), mu(pi) is the number of ones in pi and lambda(pi) is the largest part of pi.at n=35A100818
- Triangle T(n,k) = binomial(n, k)*(3*binomial(n, k)^2 - binomial(n, k) - 1), read by rows.at n=23A144405
- Triangle T(n,k) = binomial(n, k)*(3*binomial(n, k)^2 - binomial(n, k) - 1), read by rows.at n=25A144405
- Numbers k such that the number of digits d in k^2 is not prime and for each factor f of d the sum of the d/f digit groupings in k^2 of size f is a square.at n=32A153745
- Numbers k such that there are 8 digits in k^2 and for each factor f of 8 (1,2,4) the sum of digit groupings of size f is a square.at n=22A153746
- Number of 2's in the last section of the set of partitions of n.at n=38A182712
- Number of 2's in all partitions of 2n that do not contain 1 as a part.at n=19A182716
- Number of distinct weight enumerators of indecomposable Hermitian self-dual additive codes over GF(9) of length n.at n=9A196420
- Total number of smallest parts that are also emergent parts in all partitions of n.at n=38A220479
- Volume of Johnson square pyramid placed upright on cube (rounded down) with edge lengths equal to n.at n=19A227221
- Number of partitions p of n containing ceiling((min(p) + max(p))/2) as a part.at n=38A238484
- Number of times the digit 0 appears in the first 10^n decimal digits of Euler's number e = exp(1), counting starts after the decimal point.at n=4A322715
- Number of vertices formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).at n=13A331763
- E.g.f. A(x) satisfies A(x) = (1 + x*A(x)^2) * exp(x * A(x)^2).at n=4A377892
- Numbers k such that A383844(k) = 2.at n=22A384584
- Consecutive states of the linear congruential pseudo-random number generator (967*s + 3041) mod 14406 when started at s=1.at n=28A385078