6733
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6734
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 6732
- Möbius Function
- -1
- Radical
- 6733
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 44
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 868
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that (1,k) is "good".at n=42A000696
- Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6*k*(k-1) + 1.at n=33A003154
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=35A024842
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 54.at n=0A031642
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 38 ones.at n=37A031806
- Upper prime of a difference of 14 between consecutive primes.at n=34A031933
- Primes with multiplicative persistence value 5.at n=11A046505
- a(n) = Fibonacci(n) XOR Fibonacci(n+1).at n=18A051124
- a(n) is a cube mod a(i) for all i < n.at n=33A054762
- Fifth term of weak prime quintets: p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1).at n=17A054827
- a(n) = p is the smallest prime such that p = n + h(n)^2 and p is the first prime following h(n)^2. The smallest immediate post-square primes with distance n = p - h(n)^2.at n=8A058056
- A B_2 sequence: a(n) is the smallest prime such that the pairwise sums of distinct elements are all distinct.at n=39A062294
- Primes p such that the number of distinct prime divisors of all composite numbers between p and the next prime is 8.at n=44A075588
- Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=19A077405
- Primes in A003154.at n=18A083577
- Primes arising in A083989.at n=9A083990
- p(k) such that 2*p(k)+3 and 2*p(k+1) + 3 are consecutive primes, where p(i) denotes the i-th prime.at n=30A089527
- a={1,3,7,9} b[n]=Prime[n]*10+a[[4-Mod[n,4]]] c(m) =if b[n] is prime then b[n].at n=41A089686
- Primes of the form 6*p - 5 such that p and 6*p - 1 are primes.at n=32A090607
- Happy-go-Lucky primes: primes arising in A091431.at n=36A091432