9407
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9840
- Proper Divisor Sum (Aliquot Sum)
- 433
- 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
- 8976
- Möbius Function
- 1
- Radical
- 9407
- 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
- 109
- 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
- Number of 6's in all partitions of n.at n=36A024790
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 95.at n=36A031593
- Numbers k such that the decimal part of k^(1/7) starts with a 'nine digits' anagram.at n=4A034282
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 4).at n=47A035549
- Numbers whose concatenation of prime factors (with multiplicity) is a square.at n=26A038693
- a(n) = prime(n)^2 - 2.at n=24A049001
- Numbers n such that sigma(n)^2 - phi(n)^2 is a perfect square.at n=29A057654
- a(n) is the least odd number of the form p + k^2 with p prime and k > 0 which can be represented in exactly n different ways.at n=34A059400
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 4) so far).at n=30A060731
- a(n) = 48*n^2 - 1.at n=14A065532
- Frobenius number of the numerical semigroup generated by consecutive centered square numbers.at n=5A069760
- Numbers n such that P(4n) is prime, where P(m) is the number of partitions of m.at n=34A111045
- 2*JacobiSymbol(p,5) mod p^2 for p=prime(n).at n=24A113651
- a(n) = 392*n - 1.at n=23A158004
- a(n) = 784*n - 1.at n=11A158399
- a(n) = 12*n^2 - 1.at n=28A158463
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 n X 2 array.at n=23A219211
- Number of tilings of a 6 X n rectangle using straight (3 X 1) trominoes and 2 X 2 tiles.at n=9A219970
- Number of tilings of a 9 X n rectangle using straight (3 X 1) trominoes and 2 X 2 tiles.at n=6A219973
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k occurrences of the string ududu, where u=(1,1), d=(1,-1).at n=38A246188