15024
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 38936
- Proper Divisor Sum (Aliquot Sum)
- 23912
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- 0
- Radical
- 1878
- Omega Function (Ω)
- 6
- 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
- Egyptian fractions: number of partitions of 1 into reciprocals of positive integers <= n.at n=20A020473
- a(n) = n^3 - n^2 + n - 1 = (n-1) * (n^2 + 1).at n=25A062158
- Number of maximal self-avoiding walks from NW to SW corners of a 4-by-n grid.at n=11A181688
- Numbers n such that the sum of the numbers in the Collatz (3x+1) iteration of n is a perfect square.at n=35A225866
- Expansion of Product_{k>=1} (1 + x^(2*k)) / (1 - x^k).at n=28A279328
- Expansion of (x+2*x^2) / (1-2*x-2*x^2+2*x^3).at n=11A285186
- Number of connected squarefree bipartite graphs on n vertices.at n=13A300749
- G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies: [Sum_{n>=0} x^n/(1 - x^(n+1))]^4 = Sum_{n>=0} a(n)*x^n/(1 - x^(n+1))^4.at n=14A341375
- a(n) = usigma(A276086(n)), where usigma (A034448) is multiplicative with a(p^e) = (p^e)+1, and A276086 gives the prime product form of primorial base expansion of n.at n=55A348996
- Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components and without isolated nodes.at n=26A361588