6315
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10128
- Proper Divisor Sum (Aliquot Sum)
- 3813
- 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
- 3360
- Möbius Function
- -1
- Radical
- 6315
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 62
- Smith Number
- yes
- 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
- Number of paraffins.at n=28A005997
- Digit sum of 'odd' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=33A036927
- Numerators of continued fraction convergents to sqrt(337).at n=6A041636
- Numbers whose base-5 representation contains exactly three 0's and two 2's.at n=26A045186
- a(n) = n*(2*n^2 - 2*n + 1).at n=15A059722
- Harshad numbers which terminate in their digital sum.at n=37A070938
- Sum of the remainders when the n-th triangular number is divided by all smaller triangular numbers > 1.at n=45A072524
- G.f.: A(x) = exp(sum(n>=1, A084250(n)*x^n/n)), where A084250 lists the least distinct positive integers that allow A(x) to be an integer power series.at n=31A084251
- Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.at n=39A084804
- Expansion of (1-3x+x^2)/((1-2x)(1-4x+x^2)).at n=7A087946
- Integers k such that nextprime(k^5) - prevprime(k^5) = 4.at n=5A090123
- Number of closed walks of length n on the Petersen graph rooted at a given vertex.at n=10A091000
- Multiples of 15 containing a 15 in their decimal representation.at n=32A121035
- Integers 1 through n written in primorial base, summed as if decimal.at n=27A122613
- a(n) = ceiling(n/2)*ceiling(n^2/2).at n=29A131474
- Numbers of the form p*q*r, where p < q < r are odd primes such that r = +/-1 (mod p*q).at n=35A160353
- a(n) = (7*n^2 + 7*n - 12)/2.at n=41A166146
- Number of partitions of n with distinct numbers of odd and even parts.at n=31A171967
- Number of nondecreasing arrangements of n numbers in -3..3 with sum zero and sum of squares less than n*12/3.at n=22A183929
- Numbers n such that n!9-1 is prime.at n=51A204659