17253
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 26208
- Proper Divisor Sum (Aliquot Sum)
- 8955
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11340
- Möbius Function
- 0
- Radical
- 213
- Omega Function (Ω)
- 6
- 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
- 53
- 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
- Number of partitions of 1/n into 5 reciprocals of positive integers.at n=2A020328
- a(n) = floor( a(n-1)/(Pi - 3) ) with n>0, a(0)=1.at n=5A024582
- Numbers n such that n | 11^n + 9^n + 7^n + 5^n + 3^n + 1.at n=24A057832
- Numbers n such that n | 8^n + 6^n + 4^n + 2^n + 1.at n=19A057840
- Composites which use less than all of their digits in their prime factorization.at n=7A074211
- Sum of the primes in ordered 3 X 3 prime squares.at n=32A105089
- a(n) = Sum{k=0..n} C(n,3k+1)^2.at n=9A139468
- a(n) = Sum_{k=0..n} C(n,3k+2)^2.at n=9A139469
- a(n) = 12*n^2 + 22*n + 11.at n=37A154106
- INVERTi transform of A006973.at n=7A156791
- Triangle read by rows, T(n,k) = (A156791(n-k+1) * (A006973 * 0^(n-k))).at n=28A156792
- Triangle read by rows, T(n,k) = (A156791(n-k+1) * (A006973 * 0^(n-k))).at n=37A156792
- Least j such that 6*p(j)*M(n)-1 is prime with p(j)=j-th prime and M(n) = Mersenne prime.at n=23A157333
- The Wiener index of the Dutch windmill graph D(5,n) (n>=1).at n=26A180579
- Odd numbers k such that sigma(k) + sigma(k+2) > 2*sigma(k+1); odd terms in A053228.at n=39A358395
- Terms of A046337 for which A358777 is zero, where the latter is the Dirichlet inverse of former's characteristic function.at n=27A359607
- The reversing binary representation of the sum of the divisors of the n-th odd square: a(n) = A065621(A379223(n)).at n=49A379224