9363
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12488
- Proper Divisor Sum (Aliquot Sum)
- 3125
- 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
- 6240
- Möbius Function
- 1
- Radical
- 9363
- 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
- 47
- 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
- Endpoints (leaves) in rooted trees with n nodes.at n=10A003227
- 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=32A031593
- Numbers whose set of base-8 digits is {2,3}.at n=31A032808
- Numbers whose maximal base-8 run length is 4.at n=25A037995
- Numbers having four 2's in base 8.at n=10A043432
- Number of cubic residues mod 2^n.at n=14A046630
- Number of cubic residues mod 4^n.at n=7A046632
- a(n) = Sum_{k=1..n} lcm(k,n)/gcd(k,n).at n=31A056789
- Expansion of (1-x)/(1 - x - x^2 - 2*x^3).at n=15A078010
- Numbers n such that the sum of the digits of n^phi(n) is divisible by n.at n=19A109660
- Number of diagonal rectangles with corners on an n X n grid of points.at n=14A113751
- Odd positive integers a(n) such that for every odd integer m>=7 there exists a unique representation of the form m=a(p)+2a(q)+4a(r).at n=31A147845
- Numbers n such that n^2 contains no digit less than 5.at n=42A175471
- G.f.: [Sum_{n>=0} x^(n*(n+1)/2) * (1+x)^n ]^3.at n=31A182152
- Number of n X 6 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 3.at n=17A239359
- Numbers k such that 5 is the smallest decimal digit of k^2.at n=27A291630
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=11A317261
- G.f. A(x) satisfies A(x) = 1/( 1 - x*A(x)^2*(1 + 9*x*A(x))^(1/3) ).at n=6A372136