9458
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14190
- Proper Divisor Sum (Aliquot Sum)
- 4732
- 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
- 4728
- Möbius Function
- 1
- Radical
- 9458
- 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
- 60
- 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
- Number of ordered rooted trees with n edges having root of odd degree.at n=9A000958
- Coordination sequence for MgNi2, Position Mg1.at n=24A009936
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 27.at n=1A031615
- Numbers whose base-5 representation contains exactly two 0's and three 3's.at n=28A045198
- Triangle T(n,k) giving number of fixed 5 X k polyominoes with n cells (n >= 5, 1<=k<=n-4).at n=26A059681
- Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k.at n=45A065602
- Number of intersections between a sphere inscribed in a cube and the n X n X n cubes resulting from a cubic lattice subdivision of the enclosing cube.at n=43A085690
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having exactly k UDU's at low level.at n=45A098747
- Integers n such that 10^n+99 is prime.at n=28A110980
- Semiprimes in A054552.at n=17A113690
- Triangle read by rows: T(n,k) is the number of ordered trees with n edges having k even-length branches starting at the root (0<=k<=n).at n=30A127541
- a(0)=3; a(n) = n^2 + a(n-1) for n>0.at n=30A153057
- Riordan array (c(x)/(1+x*c(x)), x*c(x)), c(x) the g.f. of A000108.at n=56A167772
- Numbers n such that d(n-1) = d(n+1) = 6, where d(k) is the number of divisors of k (A000005).at n=34A190267
- Triangle read by rows: Catalan triangle of the k-Fibonacci sequence.at n=54A236918
- Convolution triangle of A000958(n+1).at n=45A237596
- Least integer k such that k/2^n > Euler's constant (0.577216...).at n=14A293353
- Solution of the complementary equation a(n) = 2*a(n-1) + b(n-1), where a(0) = 2, a(1) = 5, b(0) = 1, and (a(n)) and (b(n)) are increasing complementary sequences.at n=11A295057
- Sum of the seventh largest parts in the partitions of n into 8 parts.at n=43A308991
- Semiprimes k such that none of k-2, k-1, k+1, and k+2 is squarefree.at n=30A364010