6133
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6134
- 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
- 6132
- Möbius Function
- -1
- Radical
- 6133
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 49
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 800
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Where the prime race among 5k+1, ..., 5k+4 changes leader.at n=33A007353
- Numbers k such that the continued fraction for sqrt(k) has period 23.at n=23A020362
- Palindromic primes in base 4.at n=21A029972
- 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 22.at n=1A031610
- a(n) = prime(100*n).at n=7A031921
- Numbers whose base-4 representation contains exactly four 1's and three 3's.at n=9A045132
- Primes with first digit 6.at n=34A045712
- Row 3 of square array defined in A047671.at n=14A047672
- Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p2.at n=13A047977
- Numbers n such that 265*2^n-1 is prime.at n=20A050891
- Sum of digits of prime p is substring of p.at n=43A052019
- Row sums of triangle A053218.at n=9A053221
- Euler transform applied three times to partition triangle A008284.at n=50A055886
- Numbers k such that 80^k - 79^k is prime.at n=2A062646
- a(1) = 2; for n > 1, a(n) = largest prime not exceeding a(1) + ... + a(n-1).at n=13A068524
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^3.at n=5A070903
- Lexicographically earliest infinite sequence of distinct positive numbers with the property that every positive integer is a sum of distinct terms (see algorithm below).at n=13A075058
- a(n) = the least positive integer k such that Omega(n+k) = Omega(k)+n, where Omega(m) (A001222) denotes the number of prime factors of m, counting multiplicity.at n=10A076158
- First row of array in A081998.at n=45A081999
- Primes p such that 6*p-7 and 6*p-5 are twin primes and p is also a twin prime.at n=47A089152