6285
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 3795
- 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
- 3344
- Möbius Function
- -1
- Radical
- 6285
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 124
- 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
- Numbers that are the sum of 6 positive 6th powers.at n=43A003362
- a(n) = (d(n)-r(n))/5, where d = A026060 and r is the periodic sequence with fundamental period (0,0,1,4,0).at n=48A026062
- Numbers whose base-5 representation contains exactly three 0's and two 2's.at n=21A045186
- Nearest integer to log(n)^(n-1).at n=10A062416
- Numbers that are not the sum of two triangular numbers and a fourth power.at n=35A115160
- Numbers of the form p*q*r, where p < q < r are odd primes such that r = +/-1 (mod p*q).at n=34A160353
- Number of ways to place 4 non-attacking ferses on an n X n board.at n=4A201245
- Number of n X 3 0..2 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=29A201272
- Triangle of coefficients of polynomials v(n,x) jointly generated with A208612; see the Formula section.at n=51A208613
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209820; see the Formula section.at n=61A209819
- T(n,k)=Number of idempotent n X n -k..k matrices of rank 1.at n=14A221311
- Numbers n such that sigma(n+3) - sigma(n) = n + 3.at n=1A246853
- Numbers in A259145 that are neither prime nor semiprime.at n=31A259172
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 299", based on the 5-celled von Neumann neighborhood.at n=41A271152
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 533", based on the 5-celled von Neumann neighborhood.at n=45A272782
- Number of nX4 0..1 arrays with every element both equal and not equal to some elements at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=4A278090
- Number of nX5 0..1 arrays with every element both equal and not equal to some elements at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=3A278091
- T(n,k)=Number of nXk 0..1 arrays with every element both equal and not equal to some elements at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=31A278094
- T(n,k)=Number of nXk 0..1 arrays with every element both equal and not equal to some elements at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=32A278094
- Numbers k such that 435*2^k+1 is prime.at n=41A323146