9374
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
- 8
- Divisor Sum
- 14520
- Proper Divisor Sum (Aliquot Sum)
- 5146
- 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
- 4536
- Möbius Function
- -1
- Radical
- 9374
- 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
- 153
- 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
- yes
- Odd
- no
Appears in sequences
- Number of terms in a skew determinant: a(n) = (A000085(n) + A081919(n))/2.at n=7A002771
- Least k>1 such that first n terms of Kolakoski sequence A000002 repeat in reverse order beginning at k-th term.at n=48A022295
- n-th Lucas number (A000204(n)) + n-th non-Lucas number (A090946(n+1)).at n=18A022801
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number A000204 > 1) and d(n) = (n-th non-Fibonacci number).at n=17A023485
- Numbers k such that sigma(phi(k)) = sigma(k) where sigma is the sum of divisors function A000203 and phi is the Euler totient function A000010.at n=6A033631
- Numbers k such that k^4 == 1 (mod 5^5).at n=11A056102
- Numbers n such that n | 7^n + 6^n + 1.at n=18A057298
- Sum of distinct orders of degree-n even permutations.at n=23A060180
- Numbers k such that sigma(k) divides sigma(phi(k)).at n=33A066831
- k such that k-th prime is of the form 2n^2 + 3n + 3.at n=33A096690
- Numbers n such that every digit occurs at least once in n^3.at n=40A119735
- a(n) = 5*n^2 + 3*n.at n=42A126264
- a(n) = 625*n - 1.at n=14A158374
- Numbers n such that sigma(sigma(phi(n))) = sigma(sigma(n)).at n=18A172466
- The number of permutations p of {1,...,n} such that |p(i)-p(i+1)| is in {2,3} for all i from 1 to n-1.at n=21A174703
- Number of n-move paths on a 3 X 3 chessboard of a queen starting or ending in a corner or side square.at n=5A180030
- Numbers of the form i*5^j-1 (i=1..4, j >= 0).at n=22A181287
- Numbers which contain only the digit 4 in their base-5 representation, with at most one exception. If the exception is the most-significant digit, it must be the digit 1, 2, or 3, otherwise the exception must be the digit 3.at n=31A188531
- a(n) = 3*5^n - 1 = 2*A057651(n).at n=5A198762
- Number of 3Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=10A240794