6303
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9216
- Proper Divisor Sum (Aliquot Sum)
- 2913
- 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
- 3800
- Möbius Function
- -1
- Radical
- 6303
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 155
- 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
- n written in fractional base 9/6.at n=30A024654
- Denominators of continued fraction convergents to sqrt(536).at n=9A042025
- Numbers whose base-5 representation contains exactly three 0's and two 2's.at n=23A045186
- Numbers of the form p*q*r where p,q,r are distinct odd palindromic primes (odd terms from A002385).at n=26A046405
- Second spoke of a hexagonal spiral.at n=46A056106
- a(n) = 0^n + 3*((n+2)^n/(n+3) - (-1)^n/(n+3)).at n=5A091760
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1.at n=7A096024
- Numerator of a(n)/2^A005187(n-1), the n-th row sums of A096651^(3/2), with a(0)=1.at n=6A096743
- Number of partitions p of n for which Odd(p) = Odd(p') (mod 4), where p' is the conjugate of p.at n=35A097566
- Triangle, read by rows, where column k equals column 0 of A113983^(k+1): T(n,k) = [A113983^(k+1)](n-k,0) for n>=k>=0.at n=47A113993
- Column 2 of triangle A113993, also equals column 0 of A113983^3.at n=7A113994
- Number of partitions of n such that the largest part and the smallest part are relatively prime.at n=30A117087
- a(n) = a(n-1)+9*a(n-2) initialized with a(0)=1, a(1)=3.at n=7A122994
- Number of base 11 n-digit numbers with adjacent digits differing by one or less.at n=7A126365
- 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, 0, 0), (-1, 1, 1), (0, -1, 0), (0, 1, 1), (1, 1, -1)}.at n=8A148980
- 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, 0, 0), (-1, 0, 1), (0, 0, -1), (1, -1, 1), (1, 1, 1)}.at n=7A149774
- a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any six consecutive digits in the sequence sum up to a prime.at n=21A152606
- 3 times 11-gonal (or hendecagonal) numbers: a(n) = 3*n*(9*n-7)/2.at n=22A153783
- a(n) = 12*n^2 + 22*n + 11.at n=22A154106
- E.g.f. A(x) = 1/(2-tan(x)-sec(x)).at n=6A185323