15371
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
- 4
- Divisor Sum
- 16200
- Proper Divisor Sum (Aliquot Sum)
- 829
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14544
- Möbius Function
- 1
- Radical
- 15371
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- Glaisher's H' numbers.at n=3A002114
- First coordinate of fundamental unit of real quadratic field with discriminant A003658(n), n >= 2.at n=37A014000
- a(n) = 11*a(n-1) + 2*a(n-2).at n=5A015593
- a(n) = dot_product(1,2,...,n)*(7,8,...,n,1,2,3,4,5,6).at n=31A026049
- a(n) = smallest number > a(n-1) such that a(1)*a(2)*...*a(n) + 1 and a(1)*a(2)*...*a(n) - 1 are primes.at n=36A051956
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 1 mod 4.at n=23A053370
- a(1)=0, a(2)=1, a(n+2) = (8*n^2+2*n+1)*a(n+1) - 2*n*(2*n-1)^3*a(n).at n=4A101269
- Exponentiation of A132841.at n=28A132842
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 11110-01111 pattern in any orientation.at n=15A147511
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (0, 0, 1), (0, 1, 0), (0, 1, 1), (1, 1, -1)}.at n=7A151095
- Semiprimes which are the sum of three distinct positive cubes in two or more distinct ways.at n=16A180089
- Matrix inverse of A186432.at n=10A186433
- Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array.at n=25A219349
- Numerators of coefficients in expansion of 1/(-1 + 2 cos(sqrt(x))).at n=4A279181
- Number of odd amicable pairs where the smaller term of the pair is less than 10^n.at n=13A360054
- Expansion of e.g.f. 1/(1 - exp(x) + exp(2*x)).at n=8A368013
- a(n) = 13*n^2 + 10*n + 3.at n=34A387659