6299
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6300
- 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
- 6298
- Möbius Function
- -1
- Radical
- 6299
- 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
- 62
- 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
- 819
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest prime p==3 (mod 8) such that Q(sqrt(-p)) has class number 2n+1.at n=21A002148
- Number of rooted identity trees with n nodes (rooted trees whose automorphism group is the identity group).at n=15A004111
- Smallest number of complexity n: smallest number requiring n 1's to build using + and *.at n=29A005520
- Incorrect duplicate of A297408.at n=4A007355
- Fibonacci sequence beginning 6, 13.at n=14A022388
- Primes that remain prime through 3 iterations of function f(x) = 9x + 10.at n=26A023299
- Number of distinct products i*j with 0 <= i, j <= n-th prime.at n=34A027419
- Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 25 (most significant digit on right).at n=18A029518
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 79.at n=8A031577
- Denominators of continued fraction convergents to sqrt(33).at n=10A041055
- Primes of the form 4*k^2 + 4*k + 59.at n=34A048988
- Numbers k such that 181*2^k-1 is prime.at n=37A050842
- a(n) = ceiling(binomial(n,8)/n).at n=19A053731
- 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=15A054827
- Primes p such that x^47 = 2 has no solution mod p.at n=19A059257
- Primes p such that x^67 = 2 has no solution mod p.at n=12A059330
- Primes p such that p^5 reversed is also prime.at n=38A059698
- Smaller of twin primes whose middle term is a multiple of A002110(4)=210.at n=7A060230
- Numbers k such that 10*k-1, 10*k-3, 10*k-7 and 10*k-9 are all prime.at n=26A064975
- Least m which can be written as i*j+i+j in n different ways: A072670(m)=n.at n=26A072671