9150
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
- 24
- Divisor Sum
- 23064
- Proper Divisor Sum (Aliquot Sum)
- 13914
- 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
- 2400
- Möbius Function
- 0
- Radical
- 1830
- Omega Function (Ω)
- 5
- 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
- 122
- 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
- yes
- Odd
- no
Appears in sequences
- Representation degeneracies for boson strings.at n=31A005292
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite DOH = Dodecasil 1H [Si34O68].qR starting with a T4 atom.at n=12A019115
- Fibonacci sequence beginning 0, 15.at n=15A022349
- a(n) = n*Fibonacci(n).at n=15A045925
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/3 of the elements are <= n/2.at n=16A047161
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/3 of the elements are <= (n-1)/2.at n=16A047172
- Number of reversible strings with n beads using exactly three different colors.at n=8A056310
- Number of primes <= n is equal to the sum of squarefree numbers from the smallest prime factor of n to the largest prime factor of n.at n=5A074252
- Triangle, read by rows, where the n-th row lists the coefficients of the polynomial of degree n, with root -1, that generates the n-th diagonal of this sequence.at n=60A091173
- Slowest increasing sequence where the absolute difference between the last digit of a(n) and the first digit of a(n+1) equals 9.at n=27A101243
- Numbers n such that phi(n) = phi(n + phi(n)).at n=47A108569
- A117965 sorted, with repetition.at n=50A115947
- Duplicate of A045925.at n=15A116562
- Egyptian fraction representation for the cube root of 76.at n=2A132550
- 6 times heptagonal numbers: a(n) = 3*n*(5*n-3).at n=25A153786
- Triangle T(n, k) = f(n, k) + f(n, n-k), where f(n, k) = A001263(n*k+1, n-k+1) if k <= n otherwise A001263(n*(n-k)+1, k+1) and T(1, k) = 1, read by rows.at n=18A157118
- Triangle T(n, k) = f(n, k) + f(n, n-k), where f(n, k) = A001263(n*k+1, n-k+1) if k <= n otherwise A001263(n*(n-k)+1, k+1) and T(1, k) = 1, read by rows.at n=17A157118
- Number of nondecreasing integer sequences of length 6 with sum zero and sum of absolute values 2n.at n=25A158140
- a(n) = n*(2*n^2 + 5*n + 15)/2.at n=20A163673
- Partial sums of Proth primes A080076.at n=19A172243