15254
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23760
- Proper Divisor Sum (Aliquot Sum)
- 8506
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7336
- Möbius Function
- -1
- Radical
- 15254
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 84
- 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
- Sin(n) decreases monotonically to -1.at n=26A046964
- a(n) = (2*n-1)*(5*n^2-5*n+2)/2.at n=14A063495
- a(0)=1; a(n) is the smallest integer > a(n-1) such that sin(a(n)) is closer to an integer (here 0 or -1) than sin(a(n-1)).at n=25A079037
- a(1) = 1+2-3 = 0, a(2) = 4+5+6-7 = 8, a(3) = 8+9+10+11-12 = 26, a(4) = 13+14+15+16+17-18 = 57, ...at n=29A111694
- a(1) = 1, and for each k >=2, a(k) is the smallest number n such that n/cos(n) > a(k)/cos(a(k)), so that a(1)/cos(a(1)) > a(2)/cos(a(2)) > ... > a(k)/cos(a(k)) > ...at n=36A172446
- a(1) = 1, and for each n >=2, a(n) is the smallest number such that 1/cos(a(n)) < 1/cos(k) for all k < n, so that 1/cos(a(1)) > 1/cos(a(2)) > ... > 1/cos(a(n)) > ...at n=25A172448
- Sum of all the middle parts in the partitions of 3n into 3 parts.at n=28A236364
- Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=2A236822
- Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=1A236823
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=7A236828
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=8A236828
- Sum of the middle parts in the partitions of 4n-1 into 3 parts.at n=21A240707
- Number of paths from (0,0) to (n,3), with vertices (i,k) satisfying 0 <= k <= 3, consisting of segments given by the vectors (1,1), (1,2), (1,-1).at n=16A247326
- Bernoulli number B_{n} has denominator 354.at n=36A255684
- Positive integers m such that m, m + 1 and m + 2 are a sum of a positive square and a positive cube.at n=35A295787
- Let X,Y,Z be positive integer solutions to X^2 = Sum_{j=0..Y-1} (1+Z*j)^2, where solutions for Y or Z < 1 are excluded. This sequence lists the values for Z sorted by X.at n=15A350888
- Number of mutual-visibility sets in the n-trapezohedral graph.at n=4A389189