9537
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14736
- Proper Divisor Sum (Aliquot Sum)
- 5199
- 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
- 5440
- Möbius Function
- 0
- Radical
- 561
- Omega Function (Ω)
- 4
- 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
- 78
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = (1/12)*(n+5)*(n+1)*n^2.at n=17A014205
- a(n) = (2*n - 1)*n^2.at n=17A015237
- Pseudoprimes to base 65.at n=34A020193
- 20-gonal (or icosagonal) numbers: a(n) = n*(9*n-8).at n=33A051872
- Least k for which the integers floor(2k/(m*(m+1))) for m=1,2,...,n are distinct.at n=37A054064
- Numbers m such that there are precisely 3 groups of order m.at n=41A055561
- Numbers which retain their position in A073666 (position not disturbed by the rearrangement).at n=39A073667
- a(n) = floor(average of first n cubes).at n=32A078618
- Starting numbers for which the RATS sequence has eventual period 14.at n=26A114615
- a(0)=1, a(1)=1, a(n) = 17*a(n/2) for n=2,4,6,..., a(n) = 16*a((n-1)/2) + a((n+1)/2) for n=3,5,7,....at n=12A116523
- Grow a binary tree using the following rules. Initially there is a single node labeled 1. At each step we add 1 to all labels less than 3. If a node has label 3 and zero or one descendants we add a new descendant labeled 1. Sequence gives sum of all labels at step n.at n=39A123015
- Row sums of A128623.at n=32A128624
- Largest number not the sum of n distinct nonzero squares.at n=24A129210
- a(n+2) = 6*a(n+1) + (-11 + n)*a(n) + (6 - 2*n)*a(n-1) for n >= 1.at n=8A130019
- 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, -1, -1), (-1, -1, 1), (-1, 1, 0), (1, -1, 1), (1, 0, 0)}.at n=10A148181
- Integer averages of the first perfect cubes up to some n^3.at n=24A164577
- Number of nondecreasing arrangements of 5 numbers x(i) in -(n+3)..(n+3) with the sum of sign(x(i))*x(i)^2 zero.at n=36A188005
- 17 times triangular numbers.at n=33A195037
- Ceiling((n+1/n)^10).at n=1A197909
- Round((n+1/n)^10).at n=1A198075