9914
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14874
- Proper Divisor Sum (Aliquot Sum)
- 4960
- 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
- 4956
- Möbius Function
- 1
- Radical
- 9914
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 45.at n=24A020384
- Numbers k such that 10*k-1, 10*k-3, 10*k-7 and 10*k-9 are all prime.at n=36A064975
- Treated as strings, n begins with Floor(sqrt(n)).at n=37A069086
- Positions of 4's in A038800 with offset 1.at n=37A115095
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns of odd length (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=39A121745
- Floor(Zeta(3)^n).at n=49A125890
- Number of binary words of length n containing at least one subword 1000001 and no subwords 10^{i}1 with i<5.at n=37A143285
- G.f. satisfies: A(x) = Catalan(x + x^2 + x^3*A(x)) where Catalan(x) = (1-sqrt(1-4*x))/(2x) is the g.f. of A000108.at n=8A162162
- Number of binary strings of length n with equal numbers of 00110 and 10001 substrings.at n=14A164255
- Smallest m such that A070965(m) = -n.at n=40A227954
- Number of nX3 0..1 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..1 introduced in row major order.at n=9A240514
- Number of 2-matchings of the n X n grid graph.at n=7A242856
- Number of (n+1) X (3+1) 0..3 arrays with every 2 X 2 subblock summing to 6 and no 2 X 2 subblock having exactly two nonzero entries.at n=4A251231
- Number of (n+1) X (5+1) 0..3 arrays with every 2 X 2 subblock summing to 6 and no 2 X 2 subblock having exactly two nonzero entries.at n=2A251233
- T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock summing to 6 and no 2 X 2 subblock having exactly two nonzero entries.at n=23A251236
- T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock summing to 6 and no 2 X 2 subblock having exactly two nonzero entries.at n=25A251236
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 22", based on the 5-celled von Neumann neighborhood.at n=36A269717
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 206", based on the 5-celled von Neumann neighborhood.at n=31A270735
- Least even number k such that the continued fraction for sqrt(k) has period n.at n=44A288185