9115
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10944
- Proper Divisor Sum (Aliquot Sum)
- 1829
- 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
- 7288
- Möbius Function
- 1
- Radical
- 9115
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 153
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- a(n) = Sum_{k=1..n} floor(k^4/n).at n=13A014819
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 7.at n=16A022321
- McKay-Thompson series of class 42A for Monster.at n=48A058671
- a(n) is the smallest positive integer such that no term in S={a(1),...,a(n)}, n>=3, divides the sum of any two other distinct terms of S, after first initializing the sequence with a(1)=3 and a(2)=4.at n=43A068573
- Multiples of 5 in which there is no common digit in successive terms.at n=24A083493
- Number of base 15 circular n-digit numbers with adjacent digits differing by 5 or less.at n=4A125378
- Triangle read by rows: T(n,k) is the number of binary trees with n edges and k jumps (n >= 0, 0 <= k <= max(0,ceiling(n/2)-1) ).at n=41A127530
- Quadruple lucky numbers (lower terms). Numbers n such that n, n+2, n+6, n+8 are all Lucky numbers.at n=14A139783
- Number of lines through at least 2 points of an 8 X n grid of points.at n=25A160848
- a(k) such that A225258 column k of T(n,k) = n*k^3 - a(k) for large n.at n=26A225263
- Partial sums of A298033.at n=45A298034
- Row sums of the convolution triangle of the Motzkin numbers (A202710).at n=9A358092
- Triangle of number of interval-closed sets T(m,n) in the product of two chains [m]x[n], for m <= n, read by rows.at n=18A367109
- Array read by rows: T(m,n) is the number of m-digit semiprimes with last digit n, 0 <= n <= 9.at n=54A374940
- Triangle of generalized Stirling numbers of the lower level of the hierarchy (case m=2).at n=24A377058
- a(n) is the largest integer k such that there is an integer m with exactly n nonunitary prime factors and m + A005117(i) is squarefree for 1 <= i <= k.at n=15A390138