8683
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9160
- Proper Divisor Sum (Aliquot Sum)
- 477
- 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
- 8208
- Möbius Function
- 1
- Radical
- 8683
- 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
- 109
- 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
- Crystal ball sequence for lattice {E_7}*.at n=3A008922
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 12.at n=15A022326
- Number of partitions of n with equal number of parts congruent to each of 2 and 4 (mod 5).at n=42A035560
- Smaller of two consecutive lucky numbers with the same digital sum.at n=35A118566
- Number of BIP* perfect graphs on n nodes.at n=7A123407
- Number of perfectly contractile perfect graphs on n nodes.at n=7A123446
- Number of n X n binary arrays, symmetric under horizontal reflection, with every 1 adjacent to at least one other 1 both bishopwise and rookwise but with no three 1s in a row bishopwise or rookwise.at n=7A144237
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (0, 1, 0), (0, 1, 1), (1, 0, 0)}.at n=7A151039
- Numbers n with property that n^3+n^2+{3,5} are twin primes.at n=26A168254
- Monotonic ordering of set S generated by these rules: if x and y are in S then 5xy-x-y is in S, and 1 is in S.at n=37A192528
- Number of nonnegative integer arrays of length n+2*5-2 with new values introduced in order 0 upwards and every value appearing only in runs of at least 5.at n=23A211697
- Triangle read by rows: T(n,k) (n >= 2, 1 <= k <= n-1) = Euclidean distance degree of variety of n X n matrices of rank <= k.at n=11A232496
- Triangle read by rows: T(n,k) (n >= 2, 1 <= k <= n-1) = Euclidean distance degree of variety of n X n matrices of rank <= k.at n=13A232496
- Smallest zeroless number x such that x^n has exactly n zero digits.at n=16A233821
- Least number k not divisible by 10 such that k^n contains n zeros.at n=17A241495
- Numbers k dividing every cyclic permutation of k^k.at n=41A262814
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 494", based on the 5-celled von Neumann neighborhood.at n=14A282663
- a(0)=0, then a(n) = smallest odd k > a(n-1) such that 6*k^prime(n)-1 is prime.at n=29A283676
- Numbers k such that (76*10^k + 113)/9 is prime.at n=18A294944
- a(n) is the number of integer partitions of n for which the smallest part is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.at n=48A318196