8680
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 14360
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2880
- Möbius Function
- 0
- Radical
- 2170
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 47
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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) = 1 + a( floor(n/1) ) + a( floor(n/2) ) + ... + a( floor(n/n) ).at n=38A003318
- Triangle read by rows: the Bell transform of the triple factorial numbers A008544 without column 0.at n=16A004747
- Numbers whose base-6 representation is the juxtaposition of two identical strings.at n=39A020334
- Weight distribution of [ 31,16,7 ] binary BCH and quadratic-residue codes.at n=12A028382
- Weight distribution of [ 31,16,7 ] binary BCH and quadratic-residue codes.at n=19A028382
- Weight distribution of [ 31,15,8 ] binary quadratic-residue code.at n=3A028383
- Least term in period of continued fraction for sqrt(n) is 6.at n=38A031430
- Numbers k such that phi(k)*d(k) is a multiple of sigma(k), where d(k) is the number of divisors of k.at n=33A050934
- Convolution triangle based on A001333(n), n >= 1.at n=38A054458
- A001333(n), n >= 1, convolved twice with itself.at n=6A054460
- Number of symmetric types of (3,2n)-hypergraphs under action of complementing group C(3,2).at n=29A055780
- Numbers k such that sigma(x) = k has exactly 7 solutions.at n=35A060663
- Non-palindromic number and its reversal are both multiples of 14.at n=32A062913
- Numbers n such that sigma(n) = phi(prime(n)+1).at n=20A067625
- a(n) = floor(Product_{i=1..n} log(prime(i+1))/log(i+1)).at n=24A089223
- Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.at n=24A097387
- Numbers n such that sigma(n) = 8*phi(n).at n=5A104901
- Numbers k such that 1*k + 1, 3*k + 1, 9*k + 1, 27*k + 1 are all primes.at n=15A112041
- Numbers k such that 1*k + 1, 3*k + 1, 9*k + 1, 27*k + 1, 81*k + 1 are all primes.at n=4A112042
- a(n) is the smallest number k larger than a(n-1) such that n*d(k)*sopf(k)=sigma(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472).at n=15A134382