9510
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
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 22896
- Proper Divisor Sum (Aliquot Sum)
- 13386
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2528
- Möbius Function
- 1
- Radical
- 9510
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 52
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = floor(2nd elementary symmetric function of Sum_{j=1..k} 1/j, k = 1,2,...,n).at n=39A025212
- Number of partitions of n into parts not of the form 7k, 7k+3 or 7k-3. Also number of partitions such that the differences between parts at distance 2 are greater than 1.at n=50A035939
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=7.at n=28A135192
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 5 and 9.at n=7A136858
- a(n) = Sum_{k=0..n} binomial(floor(n-2k/3), k).at n=18A137402
- 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), (0, -1, 1), (0, 0, 1), (0, 1, -1), (1, 1, 0)}.at n=7A150612
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 1), (0, -1), (1, 0), (1, 1)}.at n=10A151415
- a(n) = 250*n + 10.at n=37A154379
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and -1<=w+x+y<=1.at n=33A211615
- Denominators of Bernoulli numbers which are == 6 (mod 9).at n=34A218755
- Expansion of g.f. x*(1+x+x^2)/(1-x^3-x^5).at n=54A226503
- Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 or 00000101.at n=16A259768
- p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = 1 - S - S^2.at n=13A291728
- Number of nX3 0..1 arrays with every element unequal to 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=8A305084
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=57A305089
- Integers n such that the digit set of n^2 is {0,1,4,9}.at n=18A317579
- Sum of the third largest parts of the partitions of n into 8 squarefree parts.at n=48A326450
- Numbers that are the sum of ten fourth powers in ten or more ways.at n=19A345603
- Numbers that are the sum of ten fourth powers in exactly ten ways.at n=14A345862
- a(n) = prime(n)^2 + prime(n+1).at n=24A352851