8479
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
- 8680
- Proper Divisor Sum (Aliquot Sum)
- 201
- 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
- 8280
- Möbius Function
- 1
- Radical
- 8479
- 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
- 83
- 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
- Digitally balanced numbers in both bases 2 and 3.at n=9A049361
- a(n) = 2^n - 1 + 2*Fibonacci(n-1).at n=12A060161
- a(n) is the smallest positive integer such that no term in S={a(1),...,a(n)}, n>=3, divides the sum of any two other distinct terms of S, after first initializing the sequence with a(1)=3 and a(2)=4.at n=38A068573
- a(n) = A051201(n^2).at n=41A078163
- Composite numbers k such that the continued fraction for k/m contains no 2 for any 1 <= m <= k.at n=35A082409
- Main diagonal of array in A083140.at n=17A083141
- a(n) = (10^k - n)(10^k + n), where k is the number of digits in n.at n=38A110397
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 7 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=10A166057
- Number of solutions to the Diophantine equation x1*x2 + x2*x3 + x3*x4 + x4*x5 + x5*x6 = n, with all xi >= 1.at n=50A191832
- Number of distinct values taken by 6th derivative of x^x^...^x (with n x's and parentheses inserted in all possible ways) at x=1.at n=13A199883
- Number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having unequal diagonal elements or unequal antidiagonal elements, and new values 0..3 introduced in row major order.at n=1A205162
- Number of (n+1) X 3 0..3 arrays with every 2 X 2 subblock having unequal diagonal elements or unequal antidiagonal elements, and new values 0..3 introduced in row major order.at n=1A205164
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having unequal diagonal elements or unequal antidiagonal elements, and new values 0..3 introduced in row major order.at n=4A205170
- Number of partitions of n such that (maximal multiplicity of parts) = (multiplicity of the least part).at n=34A240303
- Semiprimes generated by the polynomial 2 * n^2 + 29.at n=11A241554
- Least number k >= 0 such that (n!-k)/n is prime.at n=58A245696
- Composites c for which an integer 1 < k < c exists such that (c-k)! == -1 (mod c).at n=26A256519
- T(i, j) = k is the least squarefree number with a run of exactly i>=0 nonsquarefree numbers immediately preceding k and a run of exactly j>=0 nonsquarefree numbers immediately succeeding k.at n=16A270996
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 803", based on the 5-celled von Neumann neighborhood.at n=18A273578
- Number of 4-cycles in the n X n king graph.at n=27A288918