15292
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 26768
- Proper Divisor Sum (Aliquot Sum)
- 11476
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7644
- Möbius Function
- 0
- Radical
- 7646
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 177
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 86 ones.at n=10A031854
- Number of partitions of n with equal number of parts congruent to each of 3 and 4 (mod 5).at n=44A035561
- a(2n) and a(2n+1) are side lengths of a Beentjes sequence of perfect squared rectangles, starting with a 32 X 33 rectangle.at n=4A067010
- Number of polygons with polygonal holes on the square lattice enumerated by half-perimeter.at n=8A088702
- Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) defined at Comments.at n=13A193006
- Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=6A300933
- Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=3A300936
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=48A300937
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=51A300937