9913
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10368
- Proper Divisor Sum (Aliquot Sum)
- 455
- 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
- 9460
- Möbius Function
- 1
- Radical
- 9913
- 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
- 47
- 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 for which 10k+1, 10k+3, 10k+7 and 10k+9 are primes.at n=36A007811
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 44 ones.at n=37A031812
- Treated as strings, n begins with Floor(sqrt(n)).at n=36A069086
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=31A078970
- a(n) = n * prime(prime(n)).at n=22A080697
- Largest number that is not the sum of five n-gonal numbers.at n=22A118367
- Number of n-bead necklaces labeled with numbers -1..1 not allowing reversal, with sum zero and three times sum of squares <= n*(1)*(1+1).at n=12A208807
- Coefficients of the generalized continued fraction expansion of the inverse of Euler constant, 1/gamma = a(1) +a(1)/(a(2) +a(2)/(a(3) +a(3)/(a(4) +a(4)/....))).at n=14A233585
- Number of length 3 0..n arrays with each partial sum starting from the beginning no more than one standard deviation from its mean.at n=29A244791
- Product of n and the sum of all divisors of all positive integers <= n.at n=22A256533
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 209", based on the 5-celled von Neumann neighborhood.at n=24A270893
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 405", based on the 5-celled von Neumann neighborhood.at n=24A271814
- Numbers k such that (5*10^k + 91) / 3 is prime.at n=21A275020
- The number of weakly alternating bargraphs of semiperimeter n. A bargraph is said to be weakly alternating if its ascents and descents alternate. An ascent (descent) is a maximal sequence of consecutive U (D) steps.at n=13A275448
- Number of 2 X n 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=9A280481
- Numerator of sum of reciprocals of all divisors of all positive integers <= n.at n=7A284648
- Triangle read by rows: T(n,m) (n >= m >= 1) = number of vertices formed by drawing the lines connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares.at n=33A331453
- Number of sets of lists of [n] such that no list is longer than than the total number of lists.at n=7A386474