9454
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14760
- Proper Divisor Sum (Aliquot Sum)
- 5306
- 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
- 9454
- 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
- 60
- 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
- Nonsquare values of m in the discriminant D = 4*m leading to a new maximum of the L-function of the Dirichlet series L(1) = Sum_{k>0} Kronecker(D,k)/k.at n=32A003421
- a(n) = floor(floor(S3)/floor(S1)), where S3 and S1 are, respectively, the 3rd and first elementary symmetric functions of {sqrt(k), k = 1,2,...,n}.at n=48A025200
- Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.at n=14A064112
- a(1) = 2. For n>1, a(n) = smallest m such that m == 0 (mod prime(n)), m + 1 == 0 (mod prime(n+1)) and m-1 == 0 (mod prime(n-1)).at n=9A078455
- Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I.at n=7A084813
- Numbers k such that 5*10^k + R_k + 2 is a prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=12A103005
- Numbers k such that k*Lucas(k) + 1 is prime.at n=24A134696
- a(n) = (prime(n)^2 + prime(n+1))/2.at n=31A140511
- a(n) = n^2 + a(n-1), with a(1)=0.at n=29A168559
- Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having two or three distinct values for every i<=n and j<=n.at n=10A211477
- a(n) = (A216363(n) - 1)/118.at n=20A216380
- T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, diagonal and antidiagonal neighbors in a random 0..3 nXk array.at n=29A220993
- Majority value maps: number of 2Xn binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, diagonal and antidiagonal neighbors in a random 0..3 2Xn array.at n=6A220994
- Numbers n such that 2*n + {3, 5, 9, 11} are all primes.at n=17A222960
- Positions of peak values in A232221.at n=38A232359
- Number of unitary polyominoes without holes with n cells. A unitary polyomino is a polyomino whose edges all have length 1.at n=32A245660
- Sphenic numbers (A007304) whose neighbors are sphenic.at n=18A248202
- Bernoulli number B_{n} has denominator 354.at n=23A255684
- Numbers whose base-5 representation is a square when read in base 10.at n=43A267765
- Expansion of Sum_{k>=1} k^2*x^k^2/(1 - x^k^2) * Product_{k>=1} 1/(1 - x^k^2).at n=57A276559