15066
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 34944
- Proper Divisor Sum (Aliquot Sum)
- 19878
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4860
- Möbius Function
- 0
- Radical
- 186
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_18 of Monster module.at n=39A034406
- s=0; d is divisor of n [here d <= n/d]; if gcd(d,n/d)=1 or gcd(d,n/d)=d then s=s+d+(n/d); [if d=n/d then s=s+d]: The sequence contains composite n for which s = 2*n.at n=3A057246
- Reverse of largest prime factor of n = smallest prime factor of n+1; a(1)=1.at n=16A071393
- Numbers k such that 13*3^k + 2 is prime.at n=14A084125
- Indices of prime Lucas 5-step numbers, A074048.at n=22A105764
- Scaled convolution of (n^3)*A000984(n) with A000984(n).at n=17A142962
- Number of arrays of 5 integers in -n..n with sum zero and the sum of every adjacent pair being odd.at n=11A202077
- Number of (n+2)X(1+2) 0..2 arrays with no 3x3 subblock diagonal sum equal to the antidiagonal sum.at n=0A257014
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no 3x3 subblock diagonal sum equal to the antidiagonal sum.at n=0A257017
- Numbers k such that (25*10^k - 73) / 3 is prime.at n=22A276845
- Number of nX3 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly three mistakes.at n=4A278850
- Number of nX5 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly three mistakes.at n=2A278852
- T(n,k)=Number of nXk 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly three mistakes.at n=23A278855
- T(n,k)=Number of nXk 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly three mistakes.at n=25A278855
- Triangle read by rows: T(n,m) is the number of pattern classes in the (n,m)-rectangular grid with 3 colors and n>=m, two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=17A283432
- Numbers k >= 1 such that A000217(k) divided by A018804(k) is an integer.at n=12A349724
- Largest cost for a permutation problem.at n=35A367185
- Triangle read by rows: T(n,k) is the number of occurrences of the periodic substring (0011)^k in the periodic string (000111)^n.at n=37A373628
- Expansion of 1/(2 - (1 + 9*x)^(2/3)).at n=6A373714
- Expansion of 1/(1 - x/(1 - x)^3)^3.at n=7A382615