9793
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11200
- Proper Divisor Sum (Aliquot Sum)
- 1407
- 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
- 8388
- Möbius Function
- 1
- Radical
- 9793
- 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
- 166
- 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
- A generalized Fibonacci sequence.at n=51A001584
- a(n) = round(sqrt( 2*Pi )^n).at n=10A001675
- a(n) = ceiling(sqrt( 2*Pi )^n).at n=10A001698
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/31).at n=25A011941
- Least sum of 4 distinct positive cubes in exactly n ways.at n=4A025421
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 70 ones.at n=7A031838
- Gaps of 8 in sequence A038593 (upper terms).at n=9A038656
- Numbers ending with '3' that are the difference of two positive cubes.at n=23A038858
- a(n) = Sum_{ d divides n } q(d), where q(d) = A000009 = number of partitions of d into distinct parts.at n=58A047966
- a(n) = 2*prime(n)^2 - prime(n+1)^2.at n=25A064051
- a(n) defines the first brilliant number, b_n, greater than 10^n. If n is odd or zero, then b_n is 10^n+a(n); and if n is a positive even number, then b_n is {10^(n/2)+a(n)}^2.at n=51A084475
- Least k such that 10^(2n-1)+k is a brilliant number.at n=25A084476
- a(0)=1, a(1)=1, a(n) = 17*a(n/2) for n=2,4,6,..., a(n) = 16*a((n-1)/2) + a((n+1)/2) for n=3,5,7,....at n=13A116523
- Number of rooted trees with total weight n, where the weight of a node at height k is k (with the root considered to be at level 1).at n=49A117357
- Start with 1015 and repeatedly reverse the digits and add 4 to get the next term.at n=84A117807
- Start with 1 and repeatedly reverse the digits and add 46 to get the next term.at n=36A118091
- a(n) = 288*n + 1.at n=33A157990
- a(n) = 576*n + 1.at n=16A158370
- a(n) = 68*n^2 + 1.at n=12A158732
- Numbers divisible by 7 in the decimal expansion of Pi, contiguous and smallest.at n=2A164526