15001
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17152
- Proper Divisor Sum (Aliquot Sum)
- 2151
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12852
- Möbius Function
- 1
- Radical
- 15001
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 164
- 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
- [ n(n-1)(n-2)(n-3)/17 ].at n=24A011927
- Quotients associated with A024011.at n=3A028581
- Multiples of 7 whose sum of digits is equal to 7.at n=29A063416
- Cupolar numbers: a(n) = (n+1)*(5*n^2 + 7*n + 3)/3.at n=20A096000
- a(n) = n^3 - n^2 + 1.at n=25A100104
- a(n+4) = a(n+3)+a(n+1)+a(n)+k(n), where k(n) = 0, 1, 0, or -1 according to n mod 4.at n=23A115059
- Expansion of 1/(x^k*(1-x-2*x^(k+1))) for k=4.at n=24A143447
- Number of n X n binary arrays with all ones connected only in a 1100-0111-0001-0001 pattern in any orientation.at n=7A147283
- a(n) = 625*n + 1.at n=23A158383
- a(n) = 24*n^2 + 1.at n=25A158547
- Row 4 of table A162430.at n=22A162433
- Array T(n,m) = A177944(2*n,2*m) read by antidiagonals.at n=30A177970
- Array T(n,m) = A177944(2*n,2*m) read by antidiagonals.at n=33A177970
- Number of (w,x,y,z) with all terms in {1,...,n} and 3w = x + y + z + n + 1.at n=38A212251
- A239461(n) / n^2.at n=14A239464
- The broken eggs problem.at n=35A256101
- Expansion of g.f. (1-2*x+51*x^2)/(1-x)^3.at n=25A257352
- Coefficients in expansion of 1/(1 - x - 2*x^5).at n=28A318777
- a(n) = (4*n^3 + 30*n^2 + 50*n)/3 + 1.at n=20A323218