9869
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 211
- 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
- 9660
- Möbius Function
- 1
- Radical
- 9869
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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 such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=11A015991
- a(n) = (2*n+1) * (4*n-1).at n=35A033566
- Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(0,5).at n=42A039861
- Numbers whose base-5 representation contains exactly three 3's and two 4's.at n=31A045306
- Composite numbers n such that k! == 1 (mod n) for some k > 2.at n=16A049048
- Sum of digits = 8 times number of digits.at n=40A061425
- Numbers k > 1 such that, in base 4, k and k^2 contain the same digits in the same proportion.at n=37A061658
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=10A065215
- Number of distinct means of nonempty subsets of {1,...,n}.at n=45A135342
- a(n) = 12*n^2 - 8*n + 9.at n=28A167585
- Odd nonprimes n such that n+d+1 is prime for all divisors d of n.at n=25A187554
- Last occurrence of n partitions in A205617.at n=24A205618
- Numbers of the form p*q, p and q prime with q=2p-3.at n=13A226755
- Number of partitions of n such that m(greatest part) = m(1), where m = multiplicity.at n=44A240078
- Least number k >= 0 such that (n!+k)/n is prime.at n=70A245695
- Fundamental discriminants d uniquely characterizing all complex biquadratic fields Q(sqrt(-3),sqrt(d)) which have 3-class group of type (3,3) and second 3-class group isomorphic to SmallGroup(729,37).at n=7A250240
- Number of (n+2)X(5+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=5A252808
- Number of (n+2) X (6+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=4A252809
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 646", based on the 5-celled von Neumann neighborhood.at n=36A273328
- Expansion of Product_{k>=1} (1 - k^2*x^k).at n=16A292164