15090
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 36288
- Proper Divisor Sum (Aliquot Sum)
- 21198
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4016
- Möbius Function
- 1
- Radical
- 15090
- Omega Function (Ω)
- 4
- 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
- 71
- 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
- yes
- Odd
- no
Appears in sequences
- Taylor series related to one in Ramanujan's Lost Notebook.at n=27A006305
- Expansion of (5 - 9*x + 6*x^2)/(1-x)^4.at n=35A080957
- Multiples of 3018.at n=4A086746
- Numbers with no 1's in their base-3, base-4, and base-5 expansions. Intersection of A005823, A023709, and A023725.at n=9A117482
- Number of partitions of n such that the number of parts having multiplicity 1 is a part and the number of distinct parts is a part.at n=43A241442
- Number of 3 X 3 matrices having all terms in {0,1,...,n} with |det| = 1.at n=3A279725
- a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = -2, a(1) = 1, a(2) = 0, a(3) = 1.at n=20A295860
- The number of paths of length 7*n from the origin to the line y = 3*x/4 with unit east and north steps that stay below the line or touch it.at n=3A300390
- Sum over all partitions of n into distinct parts of the bitwise OR of the parts.at n=36A306924
- Numbers that are not Keith numbers in any base.at n=20A320122
- 2*a(n) is the first of 5 consecutive even numbers that are sums of divisors, i.e., terms of A000203.at n=42A342560