9515
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12528
- Proper Divisor Sum (Aliquot Sum)
- 3013
- 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
- 6880
- Möbius Function
- -1
- Radical
- 9515
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite AET = AlPO4-8 [Al36P36O144] starting with a T3 atom.at n=5A018949
- Expansion of 1/((1-6x)(1-7x)(1-8x)(1-10x)).at n=3A028201
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 11 (most significant digit on left).at n=32A029456
- Numbers whose consecutive digits differ by 4.at n=51A048406
- a(0)=0, a(1)=1, a(2)=2, a(3)=3, a(4)=12; for n > 4, a(n) = 8*a(n-2) - a(n-4) - 3.at n=11A105045
- a(-1)=a(0)=1 and recursively a(n) = prime(n)*(a(n-1)+a(n-2)).at n=5A109365
- Start with 1 and repeatedly reverse the digits and add 76 to get the next term.at n=43A118226
- Zero followed by partial sums of A059100, starting at n=1.at n=30A145068
- Number of n X n binary arrays with all ones connected only in a 11110-01111 pattern in any orientation.at n=7A147505
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 11110-01111 pattern in any orientation.at n=16A147507
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 11110-01111 pattern in any orientation.at n=17A147507
- Number of nondecreasing integer sequences of length 16 with sum zero and sum of absolute values 2n.at n=12A158150
- Number of (n+2) X 3 binary arrays avoiding patterns 001 and 010 in rows and columns.at n=4A202609
- Number of (n+2) X 7 binary arrays avoiding patterns 001 and 010 in rows and columns.at n=0A202613
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows and columns.at n=10A202616
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows and columns.at n=14A202616
- Number of nX7 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=2A207441
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=38A207442
- Number of 3Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=6A207443
- Number of n X n 0..2 arrays with rows and antidiagonals unimodal.at n=2A223969