8393
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10560
- Proper Divisor Sum (Aliquot Sum)
- 2167
- 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
- 6480
- Möbius Function
- -1
- Radical
- 8393
- 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
- 127
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026659.at n=13A026667
- Number of 4-ary rooted trees with n nodes and height exactly 5.at n=15A036629
- Sets of 4 consecutive numbers with equal number of divisors.at n=25A039665
- Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities).at n=37A045940
- Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives k values.at n=5A053678
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=14A066509
- Numbers n such that sigma(reverse(n)) = phi(n).at n=10A070856
- Average of terms of n-th row of A077321.at n=30A077325
- Let b(0)=1/2, b(n) = (b(n-1)+Prime[n])/2; sequence gives 2^(n+1)*b(n).at n=8A112044
- Numbers n such that n, n+1, n+2 and n+3 are products of exactly 3 primes.at n=35A124057
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (0, -1), (0, 1), (1, 1)}.at n=7A151299
- a(n) = n*(n+1)*(5*n + 4)/6.at n=21A162147
- A sequence of triples of squarefree consecutive integers each composed of exactly three primes.at n=42A165936
- Maximal entry in row n of triangle in A169940.at n=15A169944
- Inverse permutation to A190130.at n=41A190131
- Number of 0..n arrays x(0..10) of 11 elements with zero 6th differences.at n=27A200447
- G.f.: Product_{n>=1} [ (1 - 3^n*x^n) / (1 - (n+3)^n*x^n) ]^(1/n).at n=5A206765
- Odd numbers k which satisfy the congruence 5^(2k-1) == 3^(2k-1) (mod 2k).at n=2A215738
- Integers n such that both 2*n^2 + 3*(n+2)^2 and 3*n^2 + 2*(n+2)^2 are prime.at n=29A216849
- Sum of largest parts of all partitions of n into an even number of parts.at n=25A222048