8394
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16800
- Proper Divisor Sum (Aliquot Sum)
- 8406
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2796
- Möbius Function
- -1
- Radical
- 8394
- 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
- 65
- 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
- a(n+1) = a(n) converted to base 8 from base 6 (written in base 10).at n=15A023385
- Number of dyslexic rooted compound windmills with n nodes and leaves of 2 colors where any 2 submills extending from the same node are different.at n=10A032236
- Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 2,0,3,1.at n=4A037727
- Sets of 4 consecutive numbers with equal number of divisors.at n=26A039665
- Numbers which are the sum of their proper divisors containing the digit 9.at n=25A059468
- Number of integer partitions of n with a part dividing all the other parts.at n=33A083710
- Numbers k such that k and 8*k, taken together, are zeroless pandigital.at n=28A115932
- Number of binary strings of length n with no substrings equal to 0101, 0110, or 1001.at n=17A164508
- Right edge of triangular table A138612.at n=27A166019
- Number of 2 X 2 nonsingular 0..n matrices with a(1,1) <= a(1,2) <= a(2,1) <= a(2,2).at n=18A183763
- Number of ordered octuples of distinct pairwise coprime positive integers with largest element n.at n=27A186979
- a(n) = sum (in ordinary arithmetic) of A067399(k), for k from 2^n to 2^(n+1)-1.at n=10A190376
- G.f.: exp( Sum_{n>=1} A002129(n^2)*x^n/n ), where A002129(n) is the excess of sum of odd divisors of n over sum of even divisors of n.at n=37A225925
- Sphenic numbers (A007304) whose neighbors are sphenic.at n=14A248202
- Partial sums of A019565.at n=42A288570
- Number of 6-cycles in the n-triangular honeycomb bishop graph.at n=6A290779
- G.f.: Sum_{n=-oo..+oo} n * x^n * (1 - x^n)^n.at n=77A291937
- Number of nodes of the backtrack tree for the n queens problem.at n=9A319283
- a(n) = Sum_{k = 1..n} [d_3(k)*d_3(n+1-k)], where d_3 = A007425.at n=55A331073
- a(n) = Sum_{d|n} phi(d)^(n/d+1).at n=27A342488