9415
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 3545
- 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
- 6432
- Möbius Function
- -1
- Radical
- 9415
- 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
- 60
- 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
- Number of Young tableaux of height <= 7.at n=10A007578
- a(n) = self-convolution of row n of array T given by A027082.at n=7A027103
- [ exp(5/8)*n! ].at n=6A030959
- Numbers whose base-5 representation contains exactly three 0's and two 3's.at n=31A045201
- Partial sums of rows of A047884. Young Tableaux by height.at n=51A049400
- a(0)=3; thereafter, a(n) = A002426(n+1) + Fibonacci(n-1)*(Fibonacci(n-1) + 1).at n=9A059728
- Sum of the n smallest numbers having the sum of their digits equal to n.at n=18A081928
- Numbers n such that n^2-6 and n^2+6 are both prime.at n=38A108403
- a(n) = n!*Sum_{k=0..n} bell(k+1)/k!, n=0,1..., where bell(n) are the Bell numbers, cf. A000110.at n=6A113060
- a(n)=floor(3*n^2*(2+sqrt(3))).at n=28A172526
- Half the number of n X 1 0..3 arrays with no element equal to the average of its horizontal and vertical neighbors.at n=7A197102
- T(n,k)=Half the number of nXk 0..3 arrays with no element equal to the average of its horizontal and vertical neighbors.at n=28A197109
- Number A(n,k) of domicule tilings of a k X n grid; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=59A239264
- Number A(n,k) of domicule tilings of a k X n grid; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=61A239264
- Number of domicule tilings of a 4 X n grid.at n=6A239266
- Number of domicule tilings of a 6 X n grid.at n=4A239268
- a(n) = prime(n)^3 mod (n^2 + prime(n)^2).at n=44A243769
- Irregular triangle read by rows: T(n, k) is the number of k-element proper ideals of the n-dimensional Boolean lattice, with 0 < k < 2^n.at n=69A269699
- Number of indecomposable permutations avoiding the pattern 4231.at n=7A284713
- Number of nX6 0..1 arrays with every element equal to 0, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=15A298915