6293
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7680
- Proper Divisor Sum (Aliquot Sum)
- 1387
- 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
- 5040
- Möbius Function
- -1
- Radical
- 6293
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 62
- 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
- Fermat coefficients.at n=13A000970
- Molien series for cyclic group of order 5.at n=27A008646
- a(n) = floor(C(n,4)/5).at n=31A011795
- a(n) = n*(15*n - 1)/2.at n=29A022272
- Triangle T(n,k)of numbers of asymmetric Boolean functions of n variables with exactly k = 0..2^n nonzero values (atoms) under action of complementing group C(n,2).at n=39A022619
- a(n) = binomial(n+2, 2) + binomial(n+4, 5).at n=13A027658
- Number of compositions (ordered partitions) of n into distinct parts.at n=24A032020
- a(1) = 6; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=39A046256
- Numbers k such that k^2 is formed from two subsquares that overlap in a single digit.at n=6A048422
- Numbers k such that sopfr(k) = sopfr(k + sopfr(k)).at n=13A050780
- a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.at n=27A051170
- Triangle of numbers of inequivalent Boolean functions of n variables with exactly k nonzero values (atoms) under action of complementing group.at n=41A054724
- Numbers k such that sigma(k) = phi(k) + phi(k-1).at n=3A067198
- a(n) = 7*n^2 + 14*n.at n=28A067727
- a(1) = 10; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=44A074346
- A nonsense sequence.at n=31A089075
- Coefficients arising in combinatorial field theory.at n=5A094071
- Numbers which are the sum of two positive cubes and divisible by 31.at n=10A102658
- Least k such that k*((prime(n)#)^2)-1 and k*((prime(n)#)^2)+1 are twin primes.at n=43A103557
- Triangle T, read by rows, such that column 2k+1 of T equals column k of T^2 and column 2k of T equals column k of T*R: [T^2](n+k,k) = T(n+2k+1,2k+1) and [T*R](n+k,k) = T(n+2k,2k) for n>=0, k>=0, where R = SHIFT_RIGHT(T).at n=59A117418