6242
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9366
- Proper Divisor Sum (Aliquot Sum)
- 3124
- 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
- 3120
- Möbius Function
- 1
- Radical
- 6242
- 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
- 62
- 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
- yes
- Odd
- no
Appears in sequences
- "Magic" integers: a(n+1) is the smallest integer m such that there is no overlap between the sets {m, m-a(i), m+a(i): 1 <= i <= n} and {a(i), a(i)-a(j), a(i)+a(j): 1 <= j < i <= n}.at n=44A004210
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MEI = ZSM-18 Nan[AlnSi34-nO68].28H2O (n=2.1-5.7) starting with a T2 atom.at n=12A019144
- Least k>1 such that first n terms of Kolakoski sequence A000002 repeat in reverse order beginning at k-th term.at n=39A022295
- n written in fractional base 10/6.at n=42A024661
- Numbers k such that 49*2^k+1 is prime.at n=12A032374
- Denominators of continued fraction convergents to sqrt(348).at n=10A041659
- a(n) = prime(n)^2 + 1.at n=21A066872
- Centered square numbers: a(n) = 4*n^2 + 4*n + 2.at n=39A069894
- Expansion of (1-x)^(-1)/(1 + x - x^2 + 2*x^3).at n=14A077903
- Bisection of A001157: a(n) = sigma_2(2n-1).at n=39A099978
- Least positive integer that can be represented as sum of a semiprime and a square in exactly n ways.at n=43A101181
- <h[d,d],s[d,d]*s[d,d]*s[d,d]> where h[d,d] is a homogeneous symmetric function, s[d,d] is a Schur function indexed by two parts, * represents the Kronecker product and <, > is the standard scalar product on symmetric functions.at n=28A115375
- Numbers k for which 8*k+1, 8*k+3 and 8*k+7 are primes.at n=35A123978
- Numbers n such that the greatest prime < 2^n is a twin prime member.at n=18A128945
- a(n) is the smallest natural number we cannot obtain from n, n+1, n+2, n+3, n+4, n+5, n+6 and the operators +, -, *, /, using each number only once.at n=5A143191
- Semiprimes of the form k^2+1.at n=36A144255
- 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, 0), (-1, 1, 0), (0, 1, -1), (0, 1, 0), (1, 0, 1)}.at n=7A150277
- Numbers m such that m^2 is an anagram of a Fibonacci number.at n=10A162391
- Positions where A163890 obtains distinct new values.at n=17A163891
- Record values of A163894.at n=9A163896