15317
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
- 6
- Divisor Sum
- 16578
- Proper Divisor Sum (Aliquot Sum)
- 1261
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14144
- Möbius Function
- 0
- Radical
- 901
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=33A067355
- a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists.at n=16A075154
- Numbers k such that (k / sum of digits of k) and (k+1 / sum of digits of k+1) are both semiprime.at n=29A085774
- Expansion of g.f. Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 6.at n=30A091774
- The first 10 digits of the fifth root of n contain the digits 0-9.at n=7A119520
- Multiples of 17 containing a 17 in their decimal representation.at n=30A121037
- a(n) is the smallest multiple of n such that a(n) ends with n and S(a(n))=n where S(m) is the sum of the base ten digits of m, or 0 if no such a(n) exists.at n=16A187924
- Number of squares of size n^2 in all tilings of an (n+2) X (n+2) square using integer-sided square tiles.at n=8A226892
- Expansion of (chi(x^3) / chi(-x^2))^2 in powers of x where chi() is a Ramanujan theta function.at n=48A328789
- Numbers that are the sum of eight fourth powers in seven or more ways.at n=35A345582
- Numbers that are the sum of eight fourth powers in exactly seven ways.at n=32A345839
- Numbers with sum of digits equaling 17, divisible by 17, and containing the string "17".at n=1A346904
- G.f.: 1/Product_{k>=1} (1 - x^(3*k^2)) * (1 - x^k).at n=31A385012