15232
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 36720
- Proper Divisor Sum (Aliquot Sum)
- 21488
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6144
- Möbius Function
- 0
- Radical
- 238
- Omega Function (Ω)
- 9
- 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
- 40
- 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
- sec(sec(x)-sech(x)) = 1+12/4!*x^4+15232/8!*x^8+128432832/12!*x^12...at n=2A013514
- Reciprocal Chebyshev polynomial of second kind evaluated at 4 multiplied by (-1)^n.at n=7A025171
- Intermediate edge b of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=34A031174
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 61.at n=35A031559
- Multiplicity of highest weight (or singular) vectors associated with character chi_36 of Monster module.at n=39A034424
- Number of possible queen moves on an n X n chessboard.at n=16A035005
- Xfactorials - like factorials but use carryless GF(2)[ X ] polynomial multiplication.at n=8A048631
- Sum of the first n Sophie Germain primes.at n=38A066819
- a(0)=1, a(2n) = 2a(2n-1)+a(n), a(2n+1) = 2a(2n)+2a(n).at n=11A084566
- a(n) = (1/6)*(n+1)*(10*n^2 + 17*n + 12).at n=20A102296
- G.f. satisfies A(x) = sqrt( (1 + 2*x*A(x)) / (1 - 2*x*A(x)) ).at n=7A138020
- Number of cribbage hands with score n.at n=13A143133
- Numbers with prime signature {7,1,1}, i.e., of form p^7*q*r with p, q and r distinct primes.at n=18A179696
- Number of nX2 0..2 arrays with each sum of a(1..i,1..j) no greater than i*j.at n=4A183415
- Number of n X 5 0..2 arrays with each sum of a(1..i,1..j) no greater than i*j.at n=1A183418
- T(n,k)=Number of nXk 0..2 arrays with each sum of a(1..i,1..j) no greater than i*j.at n=16A183419
- T(n,k)=Number of nXk 0..2 arrays with each sum of a(1..i,1..j) no greater than i*j.at n=19A183419
- Triangle of coefficients of polynomials u(n,x) jointly generated with A208748; see the Formula section.at n=52A208747
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209164; see the Formula section.at n=57A209165
- a(n) is the smallest number that requires at least n adjacent bit swaps in order to pack all the ones to the right.at n=45A243112